Related papers: Vector Partition Identities for $2$D, $3$D and $n$…

In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding…

A sublattice of the three-dimensional integer lattice $\mathbb Z^3$ is called cubic sublattice if there exists a basis of the sublattice whose elements are pairwise orthogonal and of equal lengths. We show that for an integer vector…

Let D be a division ring with centre F. Let T(D) be the vector space over F generated by all multiplicative commutators in D. In [1], authors have conjectured that every division ring is generated as a vector space over its centre by all of…

A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…

In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

3D point cloud classification requires distinct models from 2D image classification due to the divergent characteristics of the respective input data. While 3D point clouds are unstructured and sparse, 2D images are structured and dense.…

We prove that the space of vector fields on the boundary of a bounded domain in three dimensions is decomposed into three subspaces orthogonal to each other: elements of the first one extend to the inside of the domain as gradient fields of…

Quiver representations arise naturally in many areas across mathematics. Here we describe an algorithm for calculating the vector space of sections, or compatible assignments of vectors to vertices, of any finite-dimensional representation…

For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…

To any two-dimensional rational plane in four-dimensional space one can naturally attach a point in the Grassmannian Gr(2,4) and four lattices of rank two. Here, the first two lattices originate from the plane and its orthogonal complement…

A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…

We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…

We extend our combinatorial approach of decomposing the partition function of the Potts model on finite two-dimensional lattices of size L x N to the case of toroidal boundary conditions. The elementary quantities in this decomposition are…

We introduce a symmetry class for higher dimensional partitions - fully complementary higher dimensional partitions (FCPs) - and prove a formula for their generating function. By studying symmetry classes of FCPs in dimension 2, we define…

We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…

Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…