Related papers: 3D Polyominoes inscribed in a rectangular prism
An invariant of orientable 3-manifolds is defined by taking the minimum $n$ such that a given 3-manifold embeds in the connected sum of $n$ copies of $S^2 \times S^2$, and we call this $n$ the embedding number of the 3-manifold. We give…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…
We present a practical algorithm to compute models of rational functions with minimal resultant under conjugation by fractional linear transformations. We also report on a search for rational functions of degrees 2 and 3 with rational…
Let $B$ be a Euclidean ball in ${\mathbb R}^n$ and let $C(B)$ be a space of~continuous functions $f:B\to{\mathbb R}$ with the uniform norm $\|f\|_{C(B)}:=\max_{x\in B}|f(x)|.$ By $\Pi_1\left({\mathbb R}^n\right)$ we mean a set of…
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values…
Sequential assembly with geometric primitives has drawn attention in robotics and 3D vision since it yields a practical blueprint to construct a target shape. However, due to its combinatorial property, a greedy method falls short of…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…
This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
A parallelogram is conformally inscribed in four lines in the plane if it is inscribed in a scaled copy of the configuration of four lines. We describe the geometry of the three-dimensional Euclidean space whose points are the…
Let $I=(\mathbb{Z}^3,26,6,B)$ be a 3D digital image, let $Q(I)$ be the associated cubical complex and let $\partial Q(I)$ be the subcomplex of $Q(I)$ whose maximal cells are the quadrangles of $Q(I)$ shared by a voxel of $B$ in the…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
This paper is the fourth in a series where we describe the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key is to understand the structure of an embedded minimal disk in a ball in…
A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…
High-quality visualizations are an essential part of robotics research, enabling clear communication of results through figures, animations, and demonstration videos. While Blender is a powerful and freely available 3D graphics platform,…
The purpose of this paper is to give an effective construction for some induced structures on spheres or product of spheres of codimension 1, 2 or 3, respectively, in Euclidean space endowed with an almost product structure.