相关论文: The bricklayer problem and the Strong Cycle Lemma

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding…

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…

In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…

We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…

A classification of ordinary differential equations and finite-difference equations in one variable having polynomial solutions (the generalized Bochner problem) is given. The method used is based on the spectral problem for a polynomial…

The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…

We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of consecutive generalized Catalan numbers and find their values in the closed form.

In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices…

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Combinatorial categories satisfy a stronger form of Yoneda Lemma, namely, the isomorphism type of an object can be recovered by counting the number of homomorphisms from all other objects into it. In this work, we show that this property…

We observe that the vocabulary used to construct the "answer" to problems in computer algebra can have a dramatic effect on the computational complexity of solving that problem. We recall a formalization of this observation and explain the…

We consider combinatorial optimization problems defined over random ensembles, and study how solution cost increases when the optimal solution undergoes a small perturbation delta. For the minimum spanning tree, the increase in cost scales…

We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…

We consider a direct conversion of the, classical, set splitting problem to the directed Hamiltonian cycle problem. A constructive procedure for such a conversion is given, and it is shown that the input size of the converted instance is a…

We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.

Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…

In this study we revisit the telephone exchange problem. We discuss a generalization of the telephone exchange problem by discuss two generalizations of the Bessel polynomials. We study combinatorial properties of these polynomials, and…

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…