Related papers: An Involution on Involutions and a Generalization …
The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we…
We present a general formalism which allows us to derive the evolution equations describing one-dimensional (1D) and isotropic 2D interfacelike systems, that is based on symmetries, conservation laws, multiple scale arguments, and exploits…
Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^[n/2].…
We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
In this paper some numerical restrictions for surfaces with an involution are obtained. These formulas are used to study surfaces of general type $S$ with $p_g=q=1$ having an involution $i$ such that $S/i$ is a non-ruled surface and such…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
We consider a group SO(2n+1) over a p-adic field, and tempered irreducible representations of this group, of unipotent reduction. We use the construction due to Lusztig of these representations. In an old paper with Moeglin, we have defined…
The aim of this paper is to study the evolution of a material point of a body by itself, and not the body as a whole. To do this, we construct a groupoid encoding all the intrinsic properties of the particle and its characteristic…
For a finite group generated by involutions, the involution width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ involutions. We show that the involution width of every…
A classification of (countable) direct limits of finite dimensional involution simple associative algebras over an algebraically closed field of arbitrary characteristic is obtained. This also classifies the corresponding dimension groups.…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know,…
This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…
An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…
We show that, under an additional mild assumption, on the class of generic frontals, any involution whose fixed point set is exactly the same as the fixed point set of the Legendre involution must be the Legendre involution (Theorem 2 in \S…