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

We prove a combination theorem for PD(n)-pairs.

We study a generalization of Erd\H os's unit distances problem to chains of $k$ distances. Given $\mathcal P,$ a set of $n$ points, and a sequence of distances $(\delta_1,\ldots,\delta_k)$, we study the maximum possible number of tuples of…

In this paper, we develop the theory of the necklace ring and the logarithmic function. Regarding the necklace ring, we introduce the necklace ring functor $Nr$ from the category of special $\ld$-rings into the category of special…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

We study $n$-homomorphisms in the sense of Khudaverdian--Voronov, but generalized to maps from arbitrary rings to arbitrary commutative rings. We show that the sum of an $n$-homomorphism and an $m$-homomorphism is an $\left( n+m\right)…

The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, recall their theorem, which gives bounds on the sum and…

The collection of cyclic Hadamard matrices {H = (a_{i - j}) : 0 <= i, j < n, and a_i = -1, 1} of order n is characterized by the orthogonality relation HH^T = nI. Only two of such matrices are currently known. It will be shown that this…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

This paper introduces the concept of necklace binomial coefficients motivated by the enumeration of a special type of sequences. Several properties of these coefficients are described, including a connection between their roots and an…

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…

Recently, Dil and Boyadzhiev \cite{AD2015} proved an explicit formula for the sum of multiple harmonic numbers whose indices are the sequence $\left( {{{\left\{ 0 \right\}}_r},1} \right)$. In this paper we show that the sums of multiple…

A sum rule relating the widths of the decays of mesons belonging to heavy quark multiplets, having the same parity and light quark spin j, into the low lying $0^-$ and $1^-$ multiplet is obtained. As this sum rule follows from properties of…

A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…

We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr, and Vojt\v{e}chovsk\'{y} by showing that if such a coloring…

This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…

This paper proposes a computational method for obtaining the length of the cycle that arises from the Fibonacci series taken mod m (some number) and mod p (some prime number).

For the double of a quiver, the works of Ginzburg, Bocklandt-Le Bruyn and Schedler show that its closed paths, called the necklaces, have a natural Lie bialgebra structure. Schedler also constructed,in [Int. Math. Res. Notices, 2005 (12),…

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…