Related papers: On Erd\H{o}s covering systems in global function f…

We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

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…

Let $A$ be a finite dimensional hereditary algebra over a field $k$ and $A^{(1)}$ the duplicated algebra of $A$. We first show that the global dimension of endomorphism ring of tilting modules of $A^{(1)}$ is at most 3. Then we investigate…

Let $\Gamma_{F,n}$ be the Hermitian modular group of degree $n>1$ in sense of Hel Braun with respect to an imaginary quadratic field $F$. Let $r$ be a natural number. There exists a multiplier system of weight $1/r$ (equivalently a…

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)$…

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…

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…

In this paper we give a f-approximation algorithm for the minimum unweighted Vertex Cover problem with Hard Capacity constraints (VCHC) on f-hypergraphs. This problem generalizes standard vertex cover for which the best known approximation…

For every finite group $H$ and every finite $H$-module $A$, we determine the subgroup of negligible classes in $H^2(H,A)$, in the sense of Serre, over fields with enough roots of unity. As a consequence, we show that for every odd prime…

Consider the semisimple mod p reduction of the Galois representation associated to a Hilbert newform f by Carayol and Taylor. This paper discusses how, under certain conditions on f, the universal ring for deformations of this residual…

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…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

We prove that for every finite partition $G=A_1\cup\dots\cup A_n$ of a group $G$ either $cov(A_iA_i^{-1})\le n$ for all cells $A_i$ or else $cov(A_iA_i^{-1}A_i)<n$ for some cell $A_i$ of the partition. Here $cov(A)=\min\{|F|:F\subset…