Related papers: On sets of linear forms of maximal complexity
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…
Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…
In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…
A rational map $\phi: \mathbb{P}_k^m \dashrightarrow \mathbb{P}_k^n$ is defined by homogeneous polynomials of a common degree $d$. We establish a linear bound in terms of $d$ for the number of $(m-1)$-dimensional fibers of $\phi$, by using…
We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…
Varieties of Sums of Powers describe the additive decompositions of an homogeneous polynomial into powers of linear forms. Despite their long history, going back to Sylvester and Hilbert, few of them are known for special degrees and number…
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
Given a positive integer $M$ and a real number $q \in (1,M+1]$, an expansion of a real number $x \in \left[0,M/(q-1)\right]$ over the alphabet $A=\{0,1,\ldots,M\}$ is a sequence $(c_i) \in A^{\mathbb N}$ such that…
The problem of linear and circular permutations of n identical objects in m boxes, where a limit l is imposed on the number of objects in a box, is considered. In the linear case, where the boxes are arranged as a row, two methods of…
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…