Related papers: Complexity of short rectangles and periodicity
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…
The Hamiltonian flow of the standard metric Hamiltonian with respect to the twisted symplectic structure on the cotangent bundle describes the motion of a charged particle on the base. We prove that under certain natural hypotheses the…
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations…
In 1938, Morse and Hedlund proved that the subword complexity function of an infinite word is either bounded or at least linearly growing. In 1982, Ehrenfeucht and Rozenberg proved that this gap property holds for the subword complexity…
A Riemannian metric with a local contraction property can be used to prove existence and uniqueness of a periodic orbit and determine a subset of its basin of attraction. While the existence of such a contraction metric is equivalent to the…
We discuss a question which relates to Calderon's complex interpolation method. More precisely, we will consider the so-called "periodic" complex interpolation method, studied by Peetre. (Which also corresponds to the spaces obtained by…
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…
The paper deals with singular first order Hamiltonian systems of the form \[ \Gamma_k\dot{z}_k(t)=J\nabla_{z_k} H\big(z(t)\big),\quad z_k(t) \in \Omega \subset \mathbb{R}^2,\ k=1,\dots,N, \] where $J\in\mathbb{R}^{2\times2}$ defines the…
Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field…
Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u)=\sum_{n=0}^{\infty} T(n) in which D(u) denotes the defect of u and T(n) denotes C(n+1)-C(n)+2-P(n+1)-P(n), where C…
A permutation is $k$-coverable if it can be partitioned into $k$ monotone subsequences. Barber conjectured that, for any given permutation, if every subsequence of length $k+2 \choose 2$ is $k$-coverable then the permutation itself is…
We show that there are infinitely many pairwise nonhomothetic, complete, periodic metrics with constant scalar curvature that are conformal to the round metric on $S^n\setminus S^k$, where $k < \frac{n-2}{2}$. These metrics are obtained by…
The resonant dynamics of a charged particle, governed by the Lorentz force equation in an electromagnetic field generated by a current-carrying wire with a small harmonic modulation, is considered in this study. When regarded as a…
It is known that for a uniform morphic sequence $\boldsymbol u = \langle u_n\rangle_{n=0}^\infty$ and an algebraic number $\beta$ such that $|\beta|>1$, the number $[\![\boldsymbol{u} ]\!]_\beta:=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$…
Fully chaotic Hamiltonian systems possess an infinite number of classical solutions which are periodic, e.g. a trajectory ``p'' returns to its initial conditions after some fixed time tau_p. Our aim is to investigate the spectrum tau_1,…
We analyze the relationship between Bott periodicity in topological $K$-theory and the natural periodicity of cyclic homology. This is a basis for understanding the multiplicativity, in odd dimensions, of a bivariant Chern-Connes character…
Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto…
Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are two computational approaches to count short cycles (with…