Related papers: 3D Polyominoes inscribed in a rectangular prism
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
By studying laminations of the unit disk, we can gain insight into the structure of Julia sets of polynomials and their dynamics in the complex plane. The polynomials of a given degree, $d$, have a parameter space. The hyperbolic components…
The paper is devoted to quadratic Poisson structures compatible with the canonical linear Poisson structures on trivial 1-dimensional central extensions of semisimple Lie algebras. In particular, we develop the general theory of such…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…
We introduce and study blob and framed blob monoids. In particular, several realizations of these monoids are given. We compute the cardinality of the framed blob monoid and derive some combinatorial formulas involving this cardinality.
Pipedreams are combinatorial objects that compute Grothendieck polynomials. We introduce a new combinatorial object that naturally recast the pipedream formula. From this, we obtain the first direct combinatorial formula for the top degree…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
We study multiple tilings of 3-dimensional Euclidean space by a convex body. In a multiple tiling, a convex body $P$ is translated with a discrete multiset $\Lambda$ in such a way that each point of the space gets covered exactly $k$ times,…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We define Donaldson-Thomas invariants of Calabi-Yau orbifolds and we develop a topological vertex formalism for computing them. The basic combinatorial object is the orbifold vertex, a generating function for the number of 3D partitions…
The objective of this paper is to learn dense 3D shape correspondence for topology-varying generic objects in an unsupervised manner. Conventional implicit functions estimate the occupancy of a 3D point given a shape latent code. Instead,…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…