Related papers: On finding a particular class of combinatorial ide…
In classification problems, especially those that categorize data into a large number of classes, the classes often naturally follow a hierarchical structure. That is, some classes are likely to share similar structures and features. Those…
The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…
The main point of this paper is to present a class of equations over integers that one can check if they have a solution by checking a set of inequalities. The prototype of such equations is the equations appearing in the well-known…
State-of-the-art results in typical classification tasks are mostly achieved by unexplainable machine learning methods, like deep neural networks, for instance. Contrarily, in this paper, we investigate the application of rule learning…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
In this article, we consider birational equivalence of exponential matrices. In characteristic zero, we give a birational classification of exponential matrices of size $n$-by-$n$ $(n \geq 2)$, which consists of two types. And in positive…
We consider a combinatorial property isolated in the field of ideal convergence, a P-property for two ideals on natural numbers. We show that among selected ideals induced by disjoint families, not all pairs satisfy P-property for two…
A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in…
In this paper we construct families of bit sequences using combinatorial methods. Each sequence is derived by con- verting a collection of numbers encoding certain combinatorial nu- merics from objects exhibiting symmetry in various…
We derive a combinatorial identity which is useful in studying the distribution of Fourier coefficients of L-functions by allowing us to pass from knowledge of moments of the coefficients to the distribution of the coefficients.
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
A childhood observation of Thakur Anukulchandra that "one and one can only be two ones, not simply two" motivates a precise inquiry: what, exactly, is asserted when we pass from two concrete individuals to the numeral "2"? This paper does…