Related papers: Infinite circuits are easy. How about long ones?
A well-established approach to reasoning about loops during program analysis is to capture the effect of a loop by extracting recurrences from the loop; these express relationships between the values of variables, or program properties such…
Let $(U_n)_{n=0}^\infty$ and $(V_m)_{m=0}^\infty$ be two linear recurrence sequences. For fixed positive integers $k$ and $\ell$, fixed $k$-tuple $(a_1,\dots,a_k)\in \mathbb{Z}^k$ and fixed $\ell$-tuple $(b_1,\dots,b_\ell)\in…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
In this paper, we construct almost resolvable cycle systems of order $4k+1$ for odd $k\ge 11$. This completes the proof of the existence of almost resolvable cycle systems with odd cycle length.
We illustrate with several new applications the power and elegance of the Bendixson Dulac theorem to obtain upper bounds of the number of limit cycles for several families of planar vector fields. In some cases we propose to use a function…
We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…
The main objective of this paper is to study the regularity and stability for solutions to the conductivity problems with degenerate coefficients in the presence of two rigid conductors, as one conductor keeps motionless and another…
The Dirac oscillator coupled to an external two-component field can retain its solvability, if couplings are appropriately chosen. This provides a new class of integrable systems. A simplified way of solution is given, by recasting the…
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. ignoring the ancilla bits, is also coNP-complete. The complexity…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…
We introduce in this paper an equivalence notion for submersions $U \to \R$, $U$ open in $\R^2$, which makes it possible to identify a smooth planar curve with a unique class of submersions. This idea, which extends to the nonlinear setting…
Iterative equation is an equality with an unknown function and its iterates. There were not found a result on iterative equations with multiplication of iterates of the unknown function on $\mathbb{R}$. In this paper we use an exponential…
A long standing conjecture states that the ropelength of any alternating knot is at least proportional to its crossing number. In this paper we prove that this conjecture is true. That is, there exists a constant $b_0>0$ such that $R(K)\ge…
In this note we discuss a variant of linear logic with idempotent exponential modalities. We propose a sequent calculus system and discuss its semantics. We also give a concrete relational model for this calculus.
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
We discuss the calculation of the linear conductance through a Coulomb-blockade quantum dot in the presence of interactions beyond the charging energy. In the limit where the temperature is large compared with a typical tunneling width, we…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…
We study a method to determine the residual conductance of a correlated system by means of the ground-state properties of a large ring composed of the system itself and a long non-interacting lead. The transmission probability through the…
In this paper we show that an arbitrary solution of one ordinary difference equation is also a solution for a hierarchy of integrable difference equations. We also provide an example of such a solution that is related to sequence generated…