Related papers: On Erd\H{o}s covering systems in global function f…
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some…
Recently, Dor\"oz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of…
Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s. A central technique in this field is to approximately optimize the…
The traditional approach of defining the fundamental group first and then constructing universal coverings works well only for the class of Poincar\' e spaces. For general spaces there were several attempts to define generalized coverings…
Over a Cohen-Macaulay local ring, the minimal number of generators of a maximal Cohen-Macaulay module is bounded above by its multiplicity. In 1984 Ulrich asked whether there always exist modules for which equality holds; such modules are…
Let Z{t} be the ring of arithmetic power series that converge on the complex open unit disc. A classical result of Harbater asserts that every finite group occurs as a Galois group over the quotient field of Z{t}. We strengthen this by…
An \emph{$H$-packing} in a graph $G$ is a collection of pairwise vertex-disjoint copies of $H$ in $G$. We prove that for every $c > 0$ and every bipartite graph $H$, any $\lfloor cn \rfloor$-regular graph $G$ admits an $H$-packing that…
Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an…
Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\mathbb{N} \to \mathbb{R}$ such that for all $k \in \mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
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…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
We consider issues of moduli stabilization and "area codes" for type II flux compactifications, and the "Inverse Problem" and "Fake Superpotentials" for extremal (non)supersymmetric black holes in type II compactifications on (orientifold…
We determine upper and lower bounds for the minimal number of balls of a given radius needed to cover the space of schlicht functions.
Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood in practical contexts. Here, we present a broad characterization of its…
Using group theoretic methods only, we prove the uniqueness of the smallest embedding cover of a profinite group, Problem 36.2.25 of Field Arithmetic, 4th edition.
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…
In the early 1980s, Erd\H{o}s and S\'os initiated the study of the classical Tur\'an problem with a uniformity condition: the uniform Tur\'an density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large…
For a totally real field $F$, a finite extension $\mathbf{F}$ of $\mathbf{F}_p$ and a Galois character $\chi: G_F \to \mathbf{F}^{\times}$ unramified away from a finite set of places $\Sigma \supset \{\mathfrak{p} \mid p\}$ consider the…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…