Related papers: Complexity spectrum of some discrete dynamical sys…
We classify 0-dimensional spectral triples over complex and real algebras and provide some general statements about their differential structure. We investigate also whether such spectral triples admit a symmetry arising from the Hopf…
We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…
In this article, we determine the complexity function (configurational entropy) of jammed configurations of Rydberg atoms on a one-dimensional lattice. Our method consists of providing asymptotics for the number of jammed configurations…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
In this paper we consider a transformation $L_a$ of sequences of complex numbers. We find the inverse transformation of $L_a$ as well as the inverse of a related transformation $\tilde{L}_a$. We explore a connection to the binomial…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We propose a new method for solution of the integrability problem for evolutionary differential-difference equations of arbitrary order. It enables us to produce necessary integrability conditions, to determine whether a given equation is…
We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…
In this note, we offer a palatable introduction to the field of arithmetic dynamics. That is, we study the patterns that arise when iterating a polynomial map. This note is accessible to those who have taken an introductory proof based…
The octonions are one of the four normed division algebras, together with the real, complex and quaternion number systems. The latter three hold a primary place in random matrix theory, where in applications to quantum physics they are…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
Let $f$ be a birational map of ${\bf C}^d$, and consider the degree complexity, or asymptotic degree growth rate $\delta(f)=\lim_{n\to\infty}({\rm deg}(f^n))^{1/n}$. We introduce a family of elementary maps, which have the form $f=L\circ…
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…
An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
We relate the geometry of the resonance varieties associated to a commutative differential graded algebra model of a space to the finiteness properties of the completions of its Alexander-type invariants. We also describe in simple…
A definition of relative discrete spectrum of noncommutative W*-dynamical systems is given in terms of the basic construction of von Neumann algebras, motivated from three perspectives: Firstly, as a complementary concept to relative weak…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
Using the combinatorial information of a Brauer configuration is possible to compute each entry of the Cartan matrix of the algebra associated to the Brauer configuration.