Related papers: Enumerating Magic Distinct Labellings of the Cube
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…
We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…
Multi-label learning handles instances associated with multiple class labels. The original label space is a logical matrix with entries from the Boolean domain $\in \left \{ 0,1 \right \}$. Logical labels are not able to show the relative…
A specific Goldbach partition of any given even number greater than 6 can be found definitely.
Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…
We provide a classification of entangled states that uses new discrete entanglement invariants. The invariants are defined by algebraic properties of linear maps associated with the states. We prove a theorem on a correspondence between the…
We study C*-algebras generated by two partitions of unity with orthogonality relations governed by hypercubes $Q_n$ for $n \in \mathbb{N} \setminus \{0\}$. These "hypercube C*-algebras'' are special cases of bipartite graph C*-algebras…
We address the question of whether or not global entanglement of a quantum state can be inferred from local properties. Specifically, we are interested in genuinely multiparticle entangled states whose two-body marginals are all separable,…
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and…
We investigate monomial labellings on cell complexes, giving a minimal cellular resolution of the ideal generated by these monomials, and such that the associated quotient ring is Cohen-Macaulay. We introduce a notion of such a labelling…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
The $n$-hypercube, denoted by $Q_n$, has a vertex for each bit string of length $n$ with two vertices adjacent whenever their Hamming distance is one. The minimum number of colors needed to color $Q_n$ such that no two vertices at a…
We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the…
Excluding the existence of four MUBs in $\bbC^6$ is an open problem in quantum information. We investigate the number of product vectors in the set of four mutually unbiased bases (MUBs) in dimension six, by assuming that the set exists and…
We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…
Recent years have seen an increasing body of work examining how quantum entanglement can be measured at high energy particle physics experiments, thereby complementing traditional table-top experiments. This raises the question of whether…
Partition-based methods are increasingly-used in extreme multi-label classification (XMC) problems due to their scalability to large output spaces (e.g., millions or more). However, existing methods partition the large label space into…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…