Related papers: Integer Complexity Generalizations in Various Ring…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
We consider the $k$-higher Mahler measure $m_k(P)$ of a Laurent polynomial $P$ as the integral of $\log ^k \left| P \right|$ over the complex unit circle. In this paper we derive an explicit formula for the value of $\left| m_k(P)…
An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…
We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…
We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…
This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new…
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the…
The $k$-higher Mahler measure of a nonzero polynomial $P$ is the integral of $\log^k|P|$ on the unit circle. In this note, we consider Lehmer's question (which is a long-standing open problem for $k=1$) for $k>1$ and find some interesting…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
Given a graph with edges labeled by elements in $\mathbb{Z}/m\mathbb{Z}$, a generalized spline is a labeling of each vertex by an integer $\mod m$ such that the labels of adjacent vertices agree modulo the label associated to the edge…
Class groups of real quadratic fields represent fundamental structures in algebraic number theory with significant computational implications. While Stark's conjecture establishes theoretical connections between special units and class…
We initiate a study of the complexity of quantum field theories (QFTs) by proposing a measure of information contained in a QFT and its observables. We show that from minimal assertions, one is naturally led to measure complexity by two…
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly…
For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…
In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver…
Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n \times n$ square matrices combining ``\emph{Strassen-like}'' fast matrix multiplication approach with…
Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…
A map between manifolds induces stratifications of both the source and the target according to the occurring multisingularities. In this paper, we study universal expressions-called higher Thom polynomials-that describe the…