Related papers: Interpreting the two variable Distance enumerator …
In the first part of this work we show the decoupling (up to contact terms) of redundant degrees of freedom which appear in the covariant description of spin two massive particles in $D=2+1$. We make use of a master action which…
The variation of spectral subspaces for linear self-adjoint operators under an additive bounded semidefinite perturbation is considered. A variant of the Davis-Kahan $ \sin2\Theta $ theorem from [SIAM J. Numer. Anal. 7 (1970), 1--46]…
We present the partition function of the refined Chern-Simons theory on $S^3$ with arbitrary A,B,C,D gauge algebra in terms of multiple sine functions. For B and C cases this representation is novel. It allows us to conjecture duality to…
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…
In this book the authors introduce the notion of DSm vector spaces of refined labels. They also realize the refined labels as a plane and a n-dimensional space. Further, using these refined labels, several algebraic structures are defined.…
Data partitioning that maximizes/minimizes the Shannon entropy, or more generally the R\'enyi entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms. These partition algorithms can be…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…
Two very different formulations of the tree-level S-matrix of N=8 Einstein supergravity in terms of rational maps are known to exist. In both formulations, the computation of a scattering amplitude of n particles in the k R-charge sector…
We study nested partitions of $R^d$ obtained by successive cuts using hyperplanes with fixed directions. We establish the number of measures that can be split evenly simultaneously by taking a partition of this kind and then distributing…
Optimizing neural networks with loss that contain high-dimensional and high-order differential operators is expensive to evaluate with back-propagation due to $\mathcal{O}(d^{k})$ scaling of the derivative tensor size and the…
The number of flats of a hyperplane arrangement is considered as a generalization of the Bell number and the Stirling number of the second kind. Robert Gill gave the exponential generating function of the number of flats of the extended…
We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…
This paper studies U(1)-Chern-Simons theory and its relation to a construction of Chris Beasley and Edward Witten. The natural geometric setup here is that of a three-manifold with a Seifert structure. Based on a suggestion of Edward Witten…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…
The space of n distinct points and a disjoint parameterized hyperplane in projective d-space up to projectivity---equivalently, configurations of n distinct points in affine d-space up to translation and homothety---has a beautiful…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
For any partition of $\{1, 2, ..., n\}$ we define its {\it increments} $X_i, 1 \le i \le n$ by $X_i = 1$ if $i$ is the smallest element in the partition block that contains it, $X_i = 0$ otherwise. We prove that for partially exchangeable…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…