Related papers: Dihedral Sieving Phenomena
In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…
We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
A Cayley digraph on a group $G$ is called NNN if the Cayley digraph is normal and its automorphism group contains a non-normal regular subgroup isomorphic to $G$. A group is called NNND-group or NNN-group if there is an NNN Cayley digraph…
We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…
A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a point stabilizer in a subgroup of $\sym(G)$ that contains all right translations. We complete a classification of abelian $2$-groups by…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
We present a new explicit family of polynomials orthogonal on the unit circle with a dense point spectrum. This family is expressed in terms of q-hypergeometric function of type ${_2}\phi_1$. The orthogonality measure is the wrapped…
It known from the work of Feigin-Tsygan, Weibel and Keller that the cohomology groups of a smooth complex variety X can be recovered from (roughly speaking) its derived category of coherent sheaves. In this paper we show that for a finite…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
In this article, we show the relation between the irreducible idempotents of the cyclic group algebra $\mathbb F_qC_n$ and the central irreducible idempotents of the group algebras $\mathbb F_qD_{2n}$, where $\mathbb F_q$ is a finite field…
The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…