Related papers: Dedekind Zeta Zeroes and Faster Complex Dimension …
The location of zeros of the basic double sum over the square lattice is studied. This sum can be represented in terms of the product of the Riemann zeta function and the Dirichlet beta function, so that the assertion that all its…
The generalized eigenvalue problem (GEP) serves as a cornerstone in a wide range of applications in numerical linear algebra and scientific computing. However, traditional approaches that aim to maximize the classical Rayleigh quotient…
According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…
We obtain a full asymptotic expansion for orthogonal polynomials with respect to weighted area measure on a Jordan domain $\mathscr{D}$ with real-analytic boundary. The weight is fixed and assumed to be real-analytically smooth and strictly…
Breaking symmetries is a popular way of speeding up the branch-and-bound method for symmetric integer programs. We study fundamental domains, which are minimal and closed symmetry breaking polyhedra. Our long-term goal is to understand the…
In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…
In this article, I derive a new approach to estimate the number of non-trivial zeros of a given Dedekind zeta function with absolute height at most $T\geq1$ counted with multiplicity. The error term in corresponding asymptotic formula…
A generalisation of Riemannian geometry is considered, based exclusively on the minimal assumptions that the line element $ds$ is a regular function of position and direction and that the distance of every point from itself is equal to…
Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for…
Valiant's famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related…
The Riemann Hypothesis (RH) - that all nonreal zeros of Riemann's zeta function shall have real part 1/2 - remains a major open problem. Its most concrete equivalent is that an infinite sequence of real numbers, the Keiper--Li constants,…
A fresh approach to the long debated question is proposed, starting from the GRAM-BACKLUND analytical continuation of the Zeta function (G-B Zeta expression). Consideration is given to the symmetric (even-exponent) and anti-symmetric (odd…
In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
We study the values taken by the Riemann zeta-function $\zeta$ on discrete sets. We show that infinite vertical arithmetic progressions are uniquely determined by the values of $\zeta$ taken on this set. Moreover, we prove a joint discrete…
We show that Mahler's classification of real numbers $\zeta$ with respect to the growth of the sequence $(w_{n}(\zeta))_{n\geq 1}$ is equivalently induced by certain natural assumptions on the decay of the sequence…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…
There have been a number of recent works on the theory of period polynomials and their zeros. In particular, zeros of period polynomials have been shown to satisfy a "Riemann Hypothesis" in both classical settings and for cohomological…
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…