Related papers: True complexity and iterated Cauchy--Schwarz
We derive an algorithm to produce explicit formulas for certain generating functions of double Hurwitz numbers. These formulas generalize a formula of Goulden, Jackson and Vakil for one part double Hurwitz numbers. Immediate consequences…
The Glauber-Sudarshan $P$-representation is used in quantum optics to distinguish between semi-classical and genuinely quantum electromagnetic fields. We employ the analog of the $P$-representation to show that the violation of the…
Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst case, believed to be impossible to perform, even given a…
One of the toughest problems in Ramsey theory is to determine the existence of monochromatic arithmetic progressions in groups whose elements have been colored. We study the harder problem to not only determine the existence of…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…
Complex metrics are a double-edged sword: they allow one to replace singular spacetimes, such as those containing a big bang, with regular metrics, yet they can also describe unphysical solutions in which quantum transitions may be more…
For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
For a linear code $\cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(\cC)$ of $\cC$ is upper bounded by $w(\cC):=\min(k,n-k)$. In this paper we point out some new lower bounds for $s(\cC)$. In…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
Differential equations are derived for a continuous limit of iterated Schwarzian reflection of analytic curves, and solutions are interpreted as geodesics in an infinite-dimensional symmetric space geometry.
We give a bound on the number of weighted real forms of a complex variety with finite automorphism group, where the weight is the inverse of the number of automorphisms of the real form. We give another bound involving the Sylow 2-subgroup…
We prove two new reverse Cauchy--Schwarz inequalities of additive and multiplicative types in a space equipped with a positive sesquilinear form with values in a C*-algebra. We apply our results to get some norm and integral inequalities.…
In this work we provide an upper bound for the multiplicity of a one-dimensional Cohen-Macaulay ring (under certain conditions), describe the rings attaining the equality for this bound, and outline a connection with Wilf's conjecture for…