English
Related papers

Related papers: Quarter-Turn Baxter Permutations

200 papers

Baxter permutations are a class of permutations which are in bijection with a class of floorplans that arise in chip design called mosaic floorplans. We study a subclass of mosaic floorplans called $HFO_k$ defined from mosaic floorplans by…

Discrete Mathematics · Computer Science 2016-03-14 Shankar Balachandran , Sajin Koroth

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Combinatorics · Mathematics 2013-01-25 Olcay Coşkun , Müge Taşkın

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

Combinatorics · Mathematics 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…

Combinatorics · Mathematics 2018-05-28 Sophie Burrill , Julien Courtiel , Eric Fusy , Stephen Melczer , Marni Mishna

We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…

Combinatorics · Mathematics 2021-02-01 Philippe Biane

The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…

Rings and Algebras · Mathematics 2007-05-23 Stephen J. Sangwine

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

Combinatorics · Mathematics 2010-03-26 Anders Claesson , Sergey Kitaev , Einar Steingrimsson

Baxter permutations arose in the study of fixed points of the composite of commuting functions by Glen Baxter in 1964. This type of permutations are counted by Baxter numbers $B_n$. It turns out that $B_n$ enumerate a lot of discrete…

Combinatorics · Mathematics 2024-10-08 James Jing Yu Zhao

Quadratic descent of hermitian and skew hermitian forms over division algebras with involution of the first kind in arbitrary characteristic is investigated and a criterion, in terms of systems of quadratic forms, is obtained. A refined…

Rings and Algebras · Mathematics 2020-02-26 Amir Hossein Nokhodkar

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

High Energy Physics - Theory · Physics 2009-10-28 S. Boukraa , J-M. Maillard , G. Rollet

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

Combinatorics · Mathematics 2007-05-23 M. D. Atkinson , M. M. Murphy , N. Ruskuc

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…

Combinatorics · Mathematics 2013-01-09 Valentin Féray , Ekaterina A. Vassilieva

A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…

Number Theory · Mathematics 2014-04-15 Luis Arenas-Carmona

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.…

Combinatorics · Mathematics 2009-09-02 Dainis Zeps

A modified Gibbs's rotation matrix is derived and the connection with the Euler angles, quaternions, and Cayley$-$Klein parameters is established. As particular cases, the Rodrigues and Gibbs parameterizations of the rotation are obtained.…

General Physics · Physics 2024-01-17 S. I. Kruglov , V. Barzda

In this extended abstract we announce a proof that, in a Coxeter group of rank 3, low elements are in bijection with small inversion sets. This gives a partial confirmation of Conjecture 2 in [Dyer, Hohlweg '16]. That same article provides…

Combinatorics · Mathematics 2022-01-26 Balthazar Charles

The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…

Mathematical Physics · Physics 2007-05-23 A. P. Yefremov

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

We introduce the notion of maximal orders over quaternion algebras with orthogonal involution and give a classification over local fields, and a partial classification over algebraic number fields.

Number Theory · Mathematics 2017-05-30 Arseniy Sheydvasser