English
Related papers

Related papers: Gog and Magog triangles, and the Schutzenberger in…

200 papers

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Combinatorics · Mathematics 2025-11-27 Thang Pham , Semin Yoo

We present simpler algorithms for two closely related morphing problems, both based on the barycentric interpolation paradigm introduced by Floater and Gotsman, which is in turn based on Floater's asymmetric extension of Tutte's classical…

Computational Geometry · Computer Science 2021-09-15 Jeff Erickson , Patrick Lin

In this paper, we study conjugacy invariants for 2-dimensional diffeomorphisms with homoclinic cubic tangencies (two-sided tangencies of the lowest order) under certain open conditions. Ordinary arguments used in past studies of conjugacy…

Dynamical Systems · Mathematics 2018-04-24 Shinobu Hashimoto

We show that any bijection between two root systems that preserves angles (but not necessarily lengths) gives rise to inequalities relating tensor product multiplicities for the corresponding complex semisimple Lie groups (or Lie algebras).…

Representation Theory · Mathematics 2007-06-18 Shrawan Kumar , John R. Stembridge

Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…

Rings and Algebras · Mathematics 2020-01-03 Luís Felipe Gonçalves Fonseca , Thiago Castilho de Mello

The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each…

Combinatorics · Mathematics 2007-05-23 David Callan

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

Combinatorics · Mathematics 2021-01-26 Karim Adiprasito , Geva Yashfe

We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.

Group Theory · Mathematics 2016-05-04 Gabriele Nebe , Richard Parker , Sarah Rees

Let $G$ be a connected complex reductive algebraic group with Lie algebra $\mathfrak{g}$. The Lusztig--Vogan bijection relates two bases for the bounded derived category of $G$-equivariant coherent sheaves on the nilpotent cone…

Representation Theory · Mathematics 2017-11-02 David B Rush

A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…

Combinatorics · Mathematics 2022-01-05 Xiaoye Liang , Ying-Ying Tan , Hajime Tanaka , Tao Wang

Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…

Combinatorics · Mathematics 2020-05-19 Houshan Fu , Suijie Wang , Weijin Zhu

We introduce a mutation algorithm for puzzles that is a three-direction analogue of the classical jeu de taquin algorithm for semistandard tableaux. We apply this algorithm to prove our conjectured puzzle formula for the equivariant…

Combinatorics · Mathematics 2014-10-30 Anders Skovsted Buch

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal…

Discrete Mathematics · Computer Science 2015-07-21 Vincent Despré , Daniel Gonçalves , Benjamin Lévêque

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon \{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$ such that the pointwise…

Combinatorics · Mathematics 2023-04-19 Sean Eberhard , Freddie Manners , Rudi Mrazović

Let $M$ be the space of triangles, defined up to shifts, rotations and dilations. We define two maps $f:M\to M$ and $g:M\to M$. The map $f$ corresponds to a triangle of perimeter $\pi$ the triangle with angles numerically equal to edges of…

Metric Geometry · Mathematics 2021-01-12 Yury Kochetkov

A morphism $g$ from the free monoid $X^*$ into itself is called upper triangular if the matrix of $g$ is upper triangular. We characterize all upper triangular binary morphisms $g_1$ and $g_2$ such that $g_1g_2=g_2g_1$.

Formal Languages and Automata Theory · Computer Science 2026-04-08 Juha Honkala

We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…

Combinatorics · Mathematics 2024-10-01 Sylvester W. Zhang

We consider the dimer problem on a non-bipartite graph $G$, where there are two types of dimers one of which we regard impurities. Results of simulations using Markov chain seem to indicate that impurities are tend to distribute on the…

Combinatorics · Mathematics 2015-05-13 Fumihiko Nakano , Taizo Sadahiro

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

Combinatorics · Mathematics 2018-08-29 Zachary Hamaker , Eric Marberg , Brendan Pawlowski
‹ Prev 1 8 9 10 Next ›