Related papers: The Attractor-Cycle Notation for Finite Transforma…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…
Following the new description of an oriented full transformation on a finite chain given recently by Higgins and Vernitski in "Orientation-preserving and orientation-reversing mappings: a new description", Semigroup Forum 104 (2022),…
This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
The transformer is a neural network component that can be used to learn useful representations of sequences or sets of data-points. The transformer has driven recent advances in natural language processing, computer vision, and…
We derive several existence results concerning cycle types and, more generally, the "mapping behavior" of complete mappings. Our focus is on so-called first-order cyclotomic mappings, which are functions on a finite field $\mathbb{F}_q$…
In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…
Let V be a d-dimensional vector space over a field of prime order p. We classify the affine transformations of V of order at least p^d/4, and apply this classification to determine the finite primitive permutation groups of affine type, and…
This paper introduces the \textit{truncator} map as a dynamical system on the space of configurations of an interacting particle system. We represent the symbolic dynamics generated by this system as a non-commutative algebra and classify…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
We consider symbolic flows over finite alphabets and study certain kinds of repetitions in these sequences. Positive and negative results for the existence of such repetitions are given for codings of interval exchange transformations and…
A four index notation (e.g. (10-11) is often used to denote reciprocal lattice vectors or crystal faces of hexagonal crystals. The purposes of this notation have never been fully explained. This note clarifies the underlying mathematics of…
The orbit closure of any translation surface under the horocycle flow in almost any direction equals its $SL_2(\mathbb{R})$ orbit closure. This result gives rise to new characterizations of lattice surfaces in terms of the hororcycle flow.
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…