Related papers: Higher Lie characters and cyclic descent extension…
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…
In these lectures we study some possible higher order (of degree greater than two) extensions of the Poincar\'e algebra. We first give some general properties of Lie superalgebras with some emphasis on the supersymmetric extension of the…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…
We prove that, over an arbitrary CM field, every symmetric formal Fourier-Jacobi series converges and equals the Fourier-Jacobi expansion of a genuine Hermitian Hilbert modular form. As an application, we show that the Chow-valued Kudla…
We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…
For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…
We consider algebras over a field $k$ of characteristic zero. The article is concerned with the isomorphism of graded vectorspaces \[ H(\gl(A))\iso\wedge (HC(A)[-1]) \] between the Lie algebra homology of matrices and the free graded…
We solve the problem of extension of characters of commutative subalgebras in associative (noncommutative) algebras for a class of subrings (Galois orders) in skew group rings. These results can be viewed as a noncommutative analogue of…
We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…
There are two main constructions in classical descent theory: the category of algebras and the descent category, which are known to be examples of weighted bilimits. We give a formal approach to descent theory, employing formal consequences…
Let $\sigma$ and $\tau$ be patterns of length three; that is $\sigma, \tau \in \{123,132,213,231,312,321\}$. In this paper, we enumerate the set of cyclic permutations in $\mathcal{S}_n$ that avoid $\sigma$ in their one-line notation and…
The simplicial endofunctor induced by a comonad in some category may underly a cyclic object in its category of endofunctors. The cyclic symmetry is then given by a sequence of natural transformations. We write down the commutation…
In this paper we recall the construction and basic properties of complex Shimura varieties and show that these properties actually characterize them. This characterization immediately implies the explicit form of Kazhdan's theorem on the…
In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a…
We present a non-commutative version of the cycle lemma of Dvoretsky and Motzkin that applies to free groups and use this result to solve a number of problems involving cyclic reduction in the free group. We also describe an application to…
We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…
Given a word binary relation $\tau$ we define a $\tau$-Gray cycle over a finite language X to be a permutation w [i] 0$\le$i$\le$|X|--1 of X such that each word wi is an image of the previous word wi--1 by $\tau$. In that framework, we…
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…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…