Related papers: Distortion in groups of generalized piecewise-line…
This article is the first of a trilogy that addresses various aspects of the perturbative response of general quantum systems, with possibly nontrivial ground state geometry, beyond linear order. Here, we use group theoretical…
It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…
A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…
We consider linear groups which do not contain unipotent elements of infinite order, which includes all linear groups in positive characteristic, and show that this class of groups has good properties which resemble those held by groups of…
In this paper all deformations of the general linear group, subject to certain restrictions which in particular ensure a smooth passage to the Lie group limit, are obtained. Representations are given in terms of certains sets of creation…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…
Let $A$ be a proper Riordan array with general element $a_{n,k}$. We study the one parameter family of matrices whose general elements are given by $a_{2n+r, n+k+r}$. We show that each such matrix can be factored into a product of a Riordan…
A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…
Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…
We prove thst the deformation complex of a d-algebra (shifted by 1-d) carries a natural structure of (d+1)-algebra. This is a purely algebraic version of a similkar theorem of Kontsevich.
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…
We develop in this paper general techniques to analyze local combinatorial structures in product sets of two subsets of a countable group which are "large" with respect to certain classes of (not necessarily invariant) means on the group.…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
Let $T(X)$ (resp. L(V)) be the semigroup of all transformations (resp. linear transformations) of a set $X$ (resp. vector space $V$). For a subset $Y$ of $X$ and a subsemigroup $\mathbb{S}(Y)$ of $T(Y)$, consider the subsemigroup…
This paper describes a generalization of decomposition in orbifolds. In general terms, decomposition states that two-dimensional orbifolds and gauge theories whose gauge groups have trivially-acting subgroups decompose into disjoint unions…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…