Related papers: Cardinality of Rauzy classes
In this paper, we compute the number of z-classes (conjugacy classes of centralizers of elements) in the symmetric group S_n, when n is greater or equal to 3 and alternating group A_n, when n is greater or equal to 4. It turns out that the…
For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…
The purpose of the present paper is to investigate a fusion rule algebra arising from irreducible characters of a compact group $G$ and a closed subgroup $G_0$ of $G$ with finite index. The convolution of this fusion rule algebra is…
Reverse differentiation is an essential operation for automatic differentiation. Cartesian reverse differential categories axiomatize reverse differentiation in a categorical framework, where one of the primary axioms is the reverse chain…
Our aim is to describe the theory of Cartesian decompositions preserved by some member of a large family of finite transitive permutation groups called innatelytransitive groups.
Let K be an abstract elementary classes which has arbitrarily large models and satisfies the amalgamation and joint embedding properties. Theorem 1. Suppose K is \chi-tame. If K is categorical in some \lambda^+ >LS(K) then it is categorical…
Given a reference lattice, we define fuzzy intervals to be the fuzzy sets such that their p-cuts are crisp closed intervals. We show that: given a complete reference lattice, the collection of its fuzzy intervals is a complete lattice.…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
We study the existence of transformations of the transfinite plane that allow one to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classical partition relations for uncountable cardinals. To exemplify: we…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
We develop a theory of Rauzy fractals for random substitutions, which are a generalisation of deterministic substitutions where the substituted image of a letter is determined by a Markov process. We show that a Rauzy fractal can be…
Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.
In this paper, we discuss the representability almost everywhere (a.e.) in the plane of an irreducible algebraic function as the Cauchy transform of a signed measure supported on a finite number of compact semi-analytic curves and a finite…
This paper aims to present objective methods for constructing new fuzzy sets from known fuzzy or classical sets, defined over the elements of a finite universe's superstructure. The paper proposes rules for assigning membership functions to…
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countably infinite Ramsey classes of permutations.
This paper contains a complete description of classes of the unitary equivalence of the admissible representations of infinite-dimensional classic matrix groups paper.