Related papers: Bounds for Erd\H{o}s covering systems in global fu…

In general the multiplicity one theorem fails for Fourier-Jacobi models over finite fields. In this paper we prove that there is an upper bound for the multiplicities of Fourier-Jacobi models which is independent of $q$. As a consequence,…

Let $S_g$ be a closed orientable surface of genus $g\geq 2$. A collection $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $S_g$ such that $\gamma_i$ and $\gamma_j$ are in minimal position, is…

A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…

Erd\"os proved in 1946 that if a set $E\subset\mathbb{R}^n$ is closed and non-empty, then the set, called ambiguous locus or medial axis, of points in $\mathbb{R}^n$ with the property that the nearest point in $E$ is not unique, can be…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

In 1981 Edgar Enochs conjectured that every module has a flat cover and finally proved this in 2001. Since then a great deal of effort has been spent on studying different types of covers, for example injective and torsion free covers. In…

In this paper, we study a novel problem, Minimum Robust Multi-Submodular Cover for Fairness (MinRF), as follows: given a ground set $V$; $m$ monotone submodular functions $f_1,...,f_m$; $m$ thresholds $T_1,...,T_m$ and a non-negative…

We apply minimal weakly generating sets to study the existence of Add$(U_R)$-covers for a uniserial module $U_R$. If $U_R$ is a uniserial right module over a ring $R$, then $S:=$End$ (U_R)$ has at most two maximal (right, left, two-sided)…

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

We have initiated the study of topology of the space of coverings on grid domains. The space has the following constraint: while all the covering agents can move freely (we allow overlapping) on the domain, their union must cover the whole…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Erd\H{o}s first showed that the number of positive integers up to $x$ which can be written as a product of two number less than $\sqrt{x}$ has zero density. Ford then found the correct order of growth of the set of all these integers. We…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

In this paper we investigate the cohomological obstruction for the field of moduli of a $G$-cover to be a field of definition, in the case of local fields and covers with tame admissible reduction. This applies in particular to $p$-adic…

We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]\to S^1$. In contrast to the number field setting, the characterization depends crucially on whether the notion of discrepancy is defined…

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper…

Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…