Related papers: Using recurrence relations to count in symmetric g…
For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…
We consider a recurrent RWRE $(X_n)_{n \in \mathbb{N}_0}$ on $\mathbb{Z}$ and investigate the quenched return probabilities of the RWRE to the origin for which we state results on their decay in terms of summability. Additionally, we give…
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…
The first part of this paper deals with unipotent and reductive groups over finite fields with $q$ elements in which either $q$ goes to infinity or $G=GL_n(q)$ and $n$ goes to infinity. The second part of the paper deals with the symmetric…
For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We give analogues in the finite general linear group of two elementary results concerning long cycles and transpositions in the symmetric group: first, that the long cycles are precisely the elements whose minimum-length factorizations into…
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
Group theoretic methods to construct all N-particle singlet states by iterative recursion are presented. These techniques are applied to the quantum correlations of four spin one-half particles in their singlet states. Multipartite…