Isolated minima of the product of n linear forms

Author(s):  
E. S. Barnes

Letbe n linear forms with real coefficients and determinant Δ = ∥ aij∥ ≠ 0; and denote by M(X) the lower bound of | X1X2 … Xn| over all integer sets (u) ≠ (0). It is well known that γn, the upper bound of M(X)/|Δ| over all sets of forms Xi, is finite, and the value of γn has been determined when n = 2 and n = 3.

1970 ◽  
Vol 22 (3) ◽  
pp. 569-581 ◽  
Author(s):  
S. K. Thomason

In this paper we shall prove that every finite lattice is isomorphic to a sublattice of the degrees of unsolvability, and that every one of a certain class of finite lattices is isomorphic to an initial segment of degrees.Acknowledgment. I am grateful to Ralph McKenzie for his assistance in matters of lattice theory.1. Representation of lattices. The equivalence lattice of the set S consists of all equivalence relations on S, ordered by setting θ ≦ θ’ if for all a and b in S, a θ b ⇒ a θ’ b. The least upper bound and greatest lower bound in are given by the ⋃ and ⋂ operations:


Author(s):  
Tapani Matala-aho

Given a sequence of linear forms in m ≥ 2 complex or p-adic numbers α1, …,αm ∈ Kv with appropriate growth conditions, Nesterenko proved a lower bound for the dimension d of the vector space Kα1 + ··· + Kαm over K, when K = Q and v is the infinite place. We shall generalize Nesterenko's dimension estimate over number fields K with appropriate places v, if the lower bound condition for |Rn| is replaced by the determinant condition. For the q-series approximations also a linear independence measure is given for the d linearly independent numbers. As an application we prove that the initial values F(t), F(qt), …, F(qm−1t) of the linear homogeneous q-functional equation where N = N(q, t), Pi = Pi(q, t) ∈ K[q, t] (i = 1, …, m), generate a vector space of dimension d ≥ 2 over K under some conditions for the coefficient polynomials, the solution F(t) and t, q ∈ K*.


Author(s):  
H. Davenport

Let L1, L2, L3 be three homogeneous linear forms in u, v, w with real coefficients and determinant 1. Let M denote the lower bound offor integral values of u, v, w, not all zero. I proved a few years ago (1) thatmore precisely, thatexcept when L1, L2, L3 are of a special type, in which case If we denote by θ, ø, ψ the roots of the cubic equation t3+t2-2t-1 = 0, the special linear forms are equivalent, by an integral unimodular linear transformation, to(in any order), where λ1,λ2,λ3 are real number whose product is In this case, L1L2L3|λ1λ2λ3 is a non-zero integer, and the minimum of its absolute value is 1, giving


2011 ◽  
Vol 54 (3) ◽  
pp. 685-693
Author(s):  
P. C. Fenton

AbstractFor functions u, subharmonic in the plane, letand let N(r,u) be the integrated counting function. Suppose that $\mathcal{N}\colon[0,\infty)\rightarrow\mathbb{R}$ is a non-negative non-decreasing convex function of log r for which $\mathcal{N}(r)=0$ for all small r and $\limsup_{r\to\infty}\log\mathcal{N}(r)/\4\log r=\rho$, where 1 < ρ < 2, and defineA sharp upper bound is obtained for $\liminf_{r\to\infty}\mathcal{B}(r,\mathcal{N})/\mathcal{N}(r)$ and a sharp lower bound is obtained for $\limsup_{r\to\infty}\mathcal{A}(r,\mathcal{N})/\mathcal{N}(r)$.


2019 ◽  
Vol 168 (3) ◽  
pp. 505-518
Author(s):  
SUIJIE WANG ◽  
YEONG–NAN YEH ◽  
FENGWEI ZHOU

AbstractLet χ(t) = a0tn – a1tn−1 + ⋯ + (−1)rartn−r be the chromatic polynomial of a graph, the characteristic polynomial of a matroid, or the characteristic polynomial of an arrangement of hyperplanes. For any integer k = 0, 1, …, r and real number x ⩾ k − r − 1, we obtain a linear bound of the coefficient sequence, that is \begin{align*} {r+x\choose k}\leqslant \sum_{i=0}^{k}a_{i}{x\choose k-i}\leqslant {m+x\choose k}, \end{align*} where m is the size of the graph, matroid, or hyperplane arrangement. It extends Whitney’s sign-alternating theorem, Meredith’s upper bound theorem, and Dowling and Wilson’s lower bound theorem on the coefficient sequence. In the end, we also propose a problem on the combinatorial interpretation of the above inequality.


2016 ◽  
Vol 25 (5) ◽  
pp. 791-796
Author(s):  
DHRUV MUBAYI

The 3-uniform tight cycle Cs3 has vertex set ${\mathbb Z}_s$ and edge set {{i, i + 1, i + 2}: i ∈ ${\mathbb Z}_s$}. We prove that for every s ≢ 0 (mod 3) with s ⩾ 16 or s ∈ {8, 11, 14} there is a cs > 0 such that the 3-uniform hypergraph Ramsey number r(Cs3, Kn3) satisfies $$\begin{equation*} r(C_s^3, K_n^3)< 2^{c_s n \log n}.\ \end{equation*}$$ This answers in a strong form a question of the author and Rödl, who asked for an upper bound of the form $2^{n^{1+\epsilon_s}}$ for each fixed s ⩾ 4, where εs → 0 as s → ∞ and n is sufficiently large. The result is nearly tight as the lower bound is known to be exponential in n.


2017 ◽  
Vol 60 (3) ◽  
pp. 513-525 ◽  
Author(s):  
BOBAN KARAPETROVIĆ

AbstractWe find the lower bound for the norm of the Hilbert matrix operator H on the weighted Bergman space Ap,α \begin{equation*} \|H\|_{A^{p,\alpha}\rightarrow A^{p,\alpha}}\geq\frac{\pi}{\sin{\frac{(\alpha+2)\pi}{p}}}, \,\, \textnormal{for} \,\, 1<\alpha+2<p. \end{equation*} We show that if 4 ≤ 2(α + 2) ≤ p, then ∥H∥Ap,α → Ap,α = $\frac{\pi}{\sin{\frac{(\alpha+2)\pi}{p}}}$, while if 2 ≤ α +2 < p < 2(α+2), upper bound for the norm ∥H∥Ap,α → Ap,α, better then known, is obtained.


Author(s):  
S. J. Taylor

It has long been known (see Lévy (3), pp. 256, 260) that the sample paths of Brownian motion in the plane form an everywhere dense set of zero Lebesgue measure, with probability 1. In (7), a capacity argument was used to show that the Hausdorff measure with respect to tα is infinite for 0 < α < 2 with probability 1 so that the dimension of the path set is known to be 2. If one considers the initial part of the sample path Cω = C(1, ω) for 0 ≤ t ≤ 1, then it becomes interesting to ask if there is a measure function ψ(t) such that, with probability 1,for suitable positive constants c1, c2. The corresponding problem for paths in k-space (k ≥ 3) has been solved. In this case, if φ1(t) = t2 log log t−1, Lévy (4) obtained the upper bound and Ciesielski and Taylor (1) obtained the lower bound. For the planar case, the path is recurrent, and the intricate fine structure makes the measure function φ1(t) inappropriate. In (2), Erdő and Taylor showed that the measure is finite with probability 1 with respect to φ2(t) = t2 log t−1, and at that time we thought that (1) might be true with ψ(t) = φ2(t). Recently Ray (5) has obtained the lower bound in (1)withThe purpose of the present note is to obtain the upper bound in (1) for the same measure function, thus showing that (2) defines the correct measure function for measuring planar Brownian motion.


1951 ◽  
Vol 47 (3) ◽  
pp. 457-460 ◽  
Author(s):  
R. P. Bambah

1. Let f(x1, x2, …, xn) be a homogeneous form with real coefficients in n variables x1, x2, …, xn. Let a1, a2, …, an be n real numbers. Define mf(a1, …, an) to be the lower bound of | f(x1 + a1, …, xn + an) | for integers x1, …, xn. Let mf be the upper bound of mf(a1, …, an) for all choices of a1, …, an. For many forms f it is known that there exist estimates for mf in terms of the invariants alone of f. On the other hand, it follows from a theorem of Macbeath* that no such estimates exist if the regionhas a finite volume. However, for such forms there may be simple estimates for mf dependent on the coefficients of f; for example, Chalk has conjectured that:If f(x,y) is reduced binary cubic form with negative discriminant, then for any real a, b there exist integers x, y such that


1998 ◽  
Vol 58 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Shiqing Zhang

Using the equivariant Ljusternik-Schnirelmann theory and the estimate of the upper bound of the critical value and lower bound for the collision solutions, we obtain some new results in the large concerning multiple geometrically distinct periodic solutions of fixed energy for a class of planar N-body type problems.


Sign in / Sign up

Export Citation Format

Share Document