Related papers: Construction and Analysis of Projected Deformed Pr…
Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…
We introduce a family of area preserving generalized baker's transformations acting on the unit square and having sharp polynomial rates of mixing for Holder data. The construction is geometric, relying on the graph of a single variable…
Traditional explicit 3D representations, such as point clouds and meshes, demand significant storage to capture fine geometric details and require complex indexing systems for surface lookups, making functional representations an efficient,…
We introduce a general framework for describing deformed phase spaces with group valued momenta. Using techniques from the theory of Poisson-Lie groups and Lie bi-algebras we develop tools for constructing Poisson structures on the deformed…
In [1] we have constructed a [n+1/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension using a $q-$deformation of the Pascal triangle. This construction extends in particular results by S.P.…
We propose a novel quaternion product unit (QPU) to represent data on 3D rotation groups. The QPU leverages quaternion algebra and the law of 3D rotation group, representing 3D rotation data as quaternions and merging them via a weighted…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
We develop an approach to the deformation quantization on the real plane with an arbitrary Poisson structure which based on Weyl symmetrically ordered operator products. By using a polydifferential representation for deformed coordinates…
Deep implicit surfaces excel at modeling generic shapes but do not always capture the regularities present in manufactured objects, which is something simple geometric primitives are particularly good at. In this paper, we propose a…
Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…
We study formal and non-formal deformation quantizations of a family of manifolds that can be obtained by phase space reduction from $\mathbb{C}^{1+n}$ with the Wick star product in arbitrary signature. Two special cases of such manifolds…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
We construct a polynomial family of semisimple left module categories over the representation category of the Drinfeld-Jimbo deformation, with the fusion rule of the representation category of each Levi subalgebra. In this construction we…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…
We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct…