Miniaturized tunable Meanderline loaded antenna with Q-factor approaching the lower bound

2011 ◽  
Author(s):  
Karim Mohammadpour-Aghdam ◽  
Reza Faraji-Dana ◽  
Guy A. E. Vandenbosch
Keyword(s):  
Lower Bound ◽  
Q Factor ◽  
Loaded Antenna

Q-FACTOR AND EXCITATION EFFICIENCY OF LAMINAR QUASI-OPTICAL DIELECTRIC RESONATORS

2014 ◽  
Vol 73 (1) ◽  
pp. 73-81 ◽  
Author(s):  
A. Ya. Kirichenko ◽  
G. V. Golubnichaya ◽  
I. G. Maximchuk ◽  
V. B. Yurchenko
Keyword(s):  
Dielectric Resonators ◽  
Q Factor ◽  
Excitation Efficiency ◽  
Optical Dielectric

WAVEGUIDE-COAXIAL RESONATOR WITH WIDE-RANGE FREQUENCY TUNING AND INCREASED Q-FACTOR

2016 ◽  
Vol 75 (10) ◽  
pp. 887-894 ◽  
Author(s):  
R. I. Bilous ◽  
A. P. Motornenko ◽  
I. G. Skuratovskiy ◽  
O. I. Khazov
Keyword(s):  
Frequency Tuning ◽  
Q Factor ◽  
Coaxial Resonator ◽  
Wide Range

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

Sign in / Sign up

Export Citation Format

Share Document