Related papers: Counting false entries in truth tables of brackete…
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…
Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…
It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted.…
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…
We derive formulas for $(i)$ the number of toroidal $n\times n$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $n\times n$ binary arrays, allowing rotation and/or…
Incomplete reporting of diagnostic accuracy data remains a persistent problem in medical research. In many studies, only part of the 2x2 diagnostic table is reported, leaving denominators for diseased and non-diseased groups unknown and…
This paper presents two alternative approaches for counting the number of two-row weakly increasing matrices, which are $2\times n$ matrices whose entries are integers from $1$ to $k$ and are weakly increasing along all rows and columns,…
In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
Difference-in-differences is a widely-used evaluation strategy that draws causal inference from observational panel data. Its causal identification relies on the assumption of parallel trends, which is scale dependent and may be…
In this paper we address the problem of handling inconsistencies in tables with missing values (also called nulls) and functional dependencies. Although the traditional view is that table instances must respect all functional dependencies…
In this paper, we compare $(n,m)$-purities for different pairs of positive integers $(n,m)$. When $R$ is a commutative ring, these purities are not equivalent if $R$ doesn't satisfy the following property: there exists a positive integer…
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
Although data may be abundant, complete data is less so, due to missing columns or rows. This missingness undermines the performance of downstream data products that either omit incomplete cases or create derived completed data for…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or…
Denote $\fm_2$ the infinite dimensional $\N$-graded Lie algebra defined by the basis $e_i$ for $i\geq 1$ and by relations $[e_1,e_i]=e_{i+1}$ for all $i\geq 2$, $[e_2,e_j]=e_{j+2}$ for all $j\geq 3$. We compute in this article the bracket…