Related papers: Combinatorial Inscribability Obstructions for High…
We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
A standard fact about two incompressible surfaces in an irreducible 3-manifold is that one can move one of them by isotopy so that their intersection becomes $\pi_1$-injective. By extending it on the maps of some 3-dimensional…
Gromov and Piatetski-Shapiro proved existence of finite volume non-arithmetic hyperbolic manifolds of any given dimension. In dimension four and higher, we show that there are about v^v such manifolds of volume at most v, considered up to…
We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
The mixed discriminant of a family of point configurations can be considered as a generalization of the $A$-discriminant of one Laurent polynomial to a family of Laurent polynomials. Generalizing the concept of defectivity, a family of…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
In the paper, we construct, for $\lambda>0$, complete embedded and non-convex $\lambda$-hypersurfaces, which are diffeomorphic to a cylinder. Hence, one can not expect that $\lambda$-hypersurfaces share a common conclusion on the planar…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…
Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Octilinear graph drawings are a standard paradigm extending the orthogonal graph drawing style by two additional slopes (+1 and -1). We are interested in two constrained drawing problems where the input specifies a so-called representation,…
Given $n \geq 3$, a combinatorial object called a \textit{ pedigree } is defined using $3$-element subsets from $[n]$ obeying certain conditions. The convex hull of pedigrees is called the pedigree polytope for $n$. Pedigrees are in $1-1$…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
All three-manifolds are known to occur as Cauchy surfaces of asymptotically flat vacuum spacetimes and of spacetimes with positive-energy sources. We prove here the conjecture that general relativity does not allow an observer to probe the…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
In this article, we continue the investigation of hep-th 1611.02179 regarding iterative properties of dual conformal integrals in higher dimensions. In d=4, iterative properties of four and five point dual conformal integrals manifest…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…