相关论文: On the P\'olya Enumeration Theorem

Generalizing a formula of Stanley, we prove combinatorially that the probability that $1, 2, \dots, k$ are contained in the same cycle of a product of two random $n$-cycles is \[\frac{1}{k} + \frac{4 (-1)^n}{ \binom{2k}{k}}…

We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those…

This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color. Our first result states that it is possible to remove one…

We consider zigzags in thin complexes. The main result states that the sum of the lengths of all zigzags in an $n$-complexe is equal to the sum of the lengths of all zigzags in all $(n-1)$-faces of this complex, and this sum also is the…

We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

In this paper, we consider three families of numerical series with general terms containing the harmonic numbers, and we use simple methods from classical and complex analysis to find explicit formulas for their respective sums.

We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.

We prove that there are exactly five sequences, including the triangular numbers, that satisfy the product rule $T(mn) = T(m) T(n) + T(m-1) T(n-1)$ for all $m, n \ge 1$.

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…

We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.

Let $\mathcal{C} = \{c_1,c_2, c_3, \ldots,c_k\}$ be a certain type of proper $k$-colouring of a given graph $G$ and $\theta(c_i)$ denote the number of times a particular colour $c_i$ is assigned to the vertices of $G$. Then, the colouring…

We prove, e.g., that if lambda=chi^+=2^chi and S subseteq {delta<lambda:cf(delta) neq cf(chi)} is stationary then diamondsuit_lambda holds true.

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…

In this article we show that if ${\cal V}$ is the variety of polynilpotent groups of class row $(c_1,c_2,...,c_s),\ {\mathcal N}_{c_1,c_2,...,c_s}$, and $G\cong{\bf {Z}}_{p^{\alpha_1}}\stackrel{n}{*}{\bf…

For a cyclic group $a$, define the atom of $a$ as the set of all elements generating $a$. Given any two elements $a,b$ of a finite cyclic group $G$, we study the sumset of the atom of $a$ and the atom of $b$. It is known that such a sumset…

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that…

For any symmetric collection of natural numbers h^{p,q} with p+q=k, we construct a smooth complex projective variety whose weight k Hodge structure has these Hodge numbers; if k=2m is even, then we have to impose that h^{m,m} is bigger than…