Related papers: On the minimum modulus problem in number fields

We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding…

It is well-known that some equational theories such as groups or boolean algebras can be defined by fewer equational axioms than the original axioms. However, it is not easy to determine if a given set of axioms is the smallest or not.…

The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…

For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error…

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a…

We substantially improve in two scenarios the current state-of-the-art modulus of continuity for weak solutions to the $N$-dimensional, two-phase Stefan problem featuring a $p-$degenerate diffusion: for $p=N\geq 3$, we sharpen it to $$…

The predictions for all the cosmological observables of any inflationary model depend on the number of e-foldings which is sensitive to the post-inflationary history of the universe. In string models the generic presence of light moduli…

Lower bounds on Hilbert-Samuel multiplicity are known for several types of commutative noetherian local rings, and rings with multiplicities which achieve these lower bounds are said to have minimal multiplicity. The first part of this…

A classical problem in combinatorics seeks colorings of low discrepancy. More concretely, the goal is to color the elements of a set system so that the number of appearances of any color among the elements in each set is as balanced as…

We study the \emph{generalized min-sum set cover} (GMSSC) problem, where given a collection of hyperedges $E$ with arbitrary covering requirements $\{k_e \in \mathbb{Z}^+ : e \in E\}$, the objective is to find an ordering of the vertices…

Based on the ideas of arXiv:1710.06612, we consider the problem of minimization of the Holder-continuous non-smooth functional $f$ with non-positive convex (generally, non-smooth) Lipschitz-continuous functional constraint. We propose some…

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

We present a new approach to convergence rate results for variational regularization. Avoiding Bregman distances and using image space approximation rates as source conditions we prove a nearly minimax theorem showing that the modulus of…

We employ analytic number theoretic techniques, specifically character sums and Weil type estimates, to study the covering radius of the generalized Zetterberg codes over all finite fields. Although the even and odd field cases require…

The paper is devoted to introducing an approach to compute the approximate minimum time function of control problems which is based on reachable set approximation and uses arithmetic operations for convex compact sets. In particular, in…

We study M theory compactifications on manifolds of $G_2$-holonomy with gauge and matter fields supported at singularities. We show that, under certain topological conditions, the combination of background $G$-flux and background fields at…

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

In this paper we answer a question posed by Horikawa in 1978, who showed that the above moduli space is composed of 11 locally closed strata building up 4 irreducible components and having at most 3 connected components. We prove that the…

We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…