Related papers: Complexity spectrum of some discrete dynamical sys…
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
We investigate the Ulrich complexity of certain examples of Brauer--Severi varieties, twisted flags and involution varieties and establish lower and upper bounds. Furthermore, we relate Ulrich complexity to the categorical representability…
Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…
We consider the Heisenberg spin triangle with general coupling coefficients and general spin quantum number $s$. The corresponding classical system is completely integrable. In the quantum case the eigenvalue problem can be reduced to that…
Faraday complexity describes whether a spectropolarimetric observation has simple or complex magnetic structure. Quickly determining the Faraday complexity of a spectropolarimetric observation is important for processing large, polarised…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
We investigate global properties of the mappings entering the description of symmetries of integrable spin and vertex models, by exploiting their nature of birational transformations of projective spaces. We give an algorithmic analysis of…
We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the existence of four more systems of parameters with different sets…
A feasible model is introduced that manifests phenomena intrinsic to iterative complex analytic maps (such as the Mandelbrot set and Julia sets). The system is composed of two coupled alternately excited oscillators (or self-sustained…