Related papers: Complexity spectrum of some discrete dynamical sys…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…
Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
Economic and ecological models can be extremely complex, with a large number of agents/species each featuring multiple interacting dynamical quantities. In an attempt to understand the generic stability properties of such systems, we define…
The Clifford spectrum is an elegant way to define the joint spectrum of several Hermitian operators. While it has been know that for examples as small as three $2$-by-$2$ matrices the Clifford spectrum can be a two-dimensional manifold, few…
Mutations of the cluster variables generating the cluster algebra of type $A^{(2)}_2$ reduce to a two-dimensional discrete integrable system given by a quartic birational map. The invariant curve of the map is a singular quartic curve, and…
. The choice of a suitable random matrix model of a complex system is very sensitive to the nature of its complexity. The statistical spectral analysis of various complex systems requires, therefore, a thorough probing of a wide range of…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
In this paper we derive novel families of inclusion sets for the spectrum and pseudospectrum of large classes of bounded linear operators, and establish convergence of particular sequences of these inclusion sets to the spectrum or…
A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
Entringer numbers occur in the Andr\'e permutation combinatorial set-up under several forms. This leads to the construction of a matrix-analog refinement of the tangent (resp. secant) numbers. Furthermore, closed expressions for the…
Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
The full spectrum of transfer matrices of the general eight-vertex model on a square lattice is obtained by numerical diagonalization. The eigenvalue spacing distribution and the spectral rigidity are analyzed. In non-integrable regimes we…
In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…