相关论文: Combinatorial identities for binary necklaces from…
Based on quantum graph theory we establish that the ray-splitting trace formula proposed by Couchman {\it et al.} (Phys. Rev. A {\bf 46}, 6193 (1992)) is exact for a class of one-dimensional ray-splitting systems. Important applications in…
In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
Simple formulas for the number of different cyclic and dihedral necklaces containing $n_j$ beads of the $j$-th color, $j\leq m$ and $\sum_{j=1}^mn_j=N$, are derived.
It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic functional equations. We present some classical and folklore results…
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…
Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums…
A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study…
It is suggested and demonstrated that two specific 2-dimensional correlation patterns, fixed-to-arbitrary bin and neighboring bin correlation patterns, are efficient for identifying various random multiplicative cascade processes. A…
We briefly discuss linear algebraic, combinatorial, and applied aspects of an exact model representation of binary arrays. As an illustration, we present two linear algebraic portraits of a string of characters.
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…
We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…
We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
We study general properties of the restriction of the representations of the finite complex reflection groups $G(de,e,r+1)$ to their maximal parabolic subgroups of type $G(de,e,r)$, and focus notably on the multiplicity of components. In…