相关论文: Cardinality of Rauzy classes

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a…

Rauzy Classes and Extended Rauzy Classes are equivalence classes of permutations that arise when studying Interval Exchange Transformations. In 2003, Kontsevich and Zorich classified Extended Rauzy Classes by using data from Translation…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…

We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…

We introduce a class of noncommutatative algebras called representation complete intersections (RCI). A graded associative algebra A is said to be RCI provided there exist arbitrarily large positive integers n such that the scheme Rep_n(A),…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…

We provide a proof of Pisot conjecture, a classification problem in Ergodic Theory on recurrent sequences generated by irreducible Pisot substitutions.

The problem of classification into symmetry integrable classes is solved for a family of second order nonlinear evolution equations labeled by arbitrary functions. Four nonequivalent symmetry integrable classes are thus obtained and the…

The concept of fuzzy cardinal semantic transformation as a basis for creating fuzzy semantic numeration systems is introduced in this work. Both fuzziness of the initial data - cardinals of abstract entities - and fuzziness of the…

From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…

Let $\pi$ be a factor code from a one dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$. If $\pi$ is finite-to-one then the number of preimages of a typical point in $Y$ is an invariant called the degree of $\pi$. In…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

Let $G$ be a finite permutation group acting on a set $\Omega$. An ordered sequence $(\omega_1,\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer of the sequence is trivial and no point…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

This paper is concerned with integrals which integrands are the monomials of matrix elements of irreducible representations of classical groups. Based on analysis on Young tableaux, we discuss some related duality theorems and compute the…

Groupoid cardinality is an invariant of locally finite groupoids which has many of the properties of the cardinality of finite sets, but which takes values in all non-negative real numbers, and accounts for the morphisms of a groupoid.…