相关论文: On a new absolute version of Siegel's lemma

For all convex co-compact hyperbolic surfaces, we prove the existence of an essential spectral gap, that is a strip beyond the unitarity axis in which the Selberg zeta function has only finitely many zeroes. We make no assumption on the…

1- It is shown that the upper bound for $\alpha$ in the general solutions of spherically symmetric vacuum field equations(gr-qc/9812081,$\Lambda$=0) is nearly 10^3.This has been obtained by comparing the theoretical prediction for bending…

We study the representation theory of the N=1 super Heisenberg-Virasoro vertex algebra at level zero, which extends the previous work on the Heisenberg-Virasoro vertex algebra arXiv:math/0201314, arXiv:1405.1707 and arXiv:1703.00531 to the…

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

We study some examples when there is actually an equality in the linear algebra bound. When the vectors considered span in fact the entire space. We would like to point out that in some cases this provides some interesting extra information…

We investigate Dirichlet-type series generated by representation functions that count the number of ways an integer can be expressed as a sum of 'k' signed higher even powers. By combining generalized theta generating functions with a…

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Bombieri and Zannier established lower and upper bounds for the limit infimum of the Weil height in fields of totally p-adic numbers and generalizations thereof. In this paper, we use potential theoretic techniques to generalize the upper…

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

One way of describing gauge theories in physics is to assign a vector space $V_{x}$ to each space time point $x.$ For each $x$ the field $\psi$ takes values $\psi(x)$ in $V_{x}.$ The freedom to choose a basis in each $V_{x}$ introduces…

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Parallel to $\widetilde{\mathrm{SL}(2,\mathbb{R})}$-geometry fibering over the hyperbolic plane, we construct a geometry fibering over the Siegel upper half-space $\mathrm{Sp}(2n,\mathbb{R})\curvearrowright {\mathfrak{H}}_n$, and provide a…

An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…

In this paper, we introduce an algebro-geometric formulation for Siegel's theorem using an improvement of Lang's version of Roth's theorem over finitely generated fields of characteristic zero. In fact, we prove that, for an affine open…

We prove inequalities that compare the size of an S-regulator with a product of heights of multiplicatively independent S-units. Our upper bound for the S-regulator follows from a general upper bound for the determinant of a real matrix…