Related papers: New dimension bounds for $\alpha\beta$ sets
The goal of this paper is to obtain lower bounds on the height of an algebraic number in a relative setting, extending previous work of Amoroso and Masser. Specifically, in our first theorem we obtain an effective bound for the height of an…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
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…
In this paper, we discuss some dimension results for triangle sets of compact sets in $\mathbb{R}^2$. In particular, we prove that for any compact set $F$ in $\mathbb{R}^2$, the triangle set $\Delta(F)$ satisfies \[ \dim_{\mathrm{A}}…
We derive an upper bound for the Assouad dimension of visible parts of self-similar sets generated by iterated function systems with finite rotation groups and satisfying the open set condition. The bound is valid for all visible parts and…
We define a dimension for a triangulated category. We prove a representabilityTheorem for a certain class of functors on finite dimensional triangulatedcategories. We study the dimension of the boundedderived category of an algebra or a…
In this paper, we utilize the sub-additive unstable pressure to give an upper bound for the upper box dimension of the $C^1$ hyperbolic set on unstable manifolds. As a by-product, we give a new expression of the topological pressure. This…
In this paper we shall establish some Liouville theorems for solutions bounded from below to certain linear elliptic equations on the upper half space. In particular, we show that for $a \in (0, 1)$ constants are the only $C^1$ up to the…
A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…
Given a topologically transitive subshift of finite type, the $u$-dimension of the $\alpha$-level set of the quotient of Birkhoff sums is a well-studied topic. In this paper, we consider the uniform $\alpha$-level set, which is a subset of…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…
Specification is an important concept in dynamical systems introduced by Bowen. Schmeling proved that the set of $\beta>1$ such that the corresponding $\beta$-shift has specification is of Hausdorff dimension $1$. Hu et al. proved that the…
In dimension $n=3$, we prove that the singular set of any stationary solution to the Liouville equation $-\Delta u=e^u$, which belongs to $W^{1,2}$, has Hausdorff dimension at most 1.
We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…
A new upper bound is given for the dimension of the space of holomorphic cusp forms of weight one and prime level $q$: $$ \hbox{dim}\, S_1(q) << q^{11/12} \log^4{q} $$ with an absolute implied constant.
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…
We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension. We show an equivalence between affine blocking sets with…
We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve ($\theta = 1.1584$) and subsequent explicit constructions ($\theta = 1.173050$). In this work, we…