Related papers: Products of Foldable Triangulations

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

We study the scaling properties of forced folding of thin materials of different geometry. The scaling relations implying the topological crossovers from the folding of threedimensional plates to the folding of two-dimensional sheets, and…

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes…

We derive conditions on the products of stochastic matrices guaranteeing the existence of a unique limit invariant distribution. Belying our approach is the hereby defined notion of restricted triangulated Laman graphs. The main idea is the…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

The quantities C_4 and Theta_2,2,2 are as defined by Wanless, C_4 just the number of 4-loops of a graph. The construction of this paper provides a counterexample to a conjecture of Butera, Pernici, and the author about the monomer-dimer…

I analyze an unexpected connection between multiple orthogonal polynomials, $d$-orthogonal polynomials, production matrices and branched continued fractions. This work can be viewed as a partial extension of Viennot's combinatorial theory…

The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…

We study the rapid decay property and polynomial growth for duals of bicrossed products coming from a matched pair of a discrete group and a compact group

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Dualising the construction of a polyhedral product, we introduce the notion of a polyhedral coproduct as a certain homotopy limit over the face poset of a simplicial complex. We begin a study of the basic properties of polyhedral…

We consider bicrossed products obtained by twisting compact semi-direct products by a suitable finite subgroup. Under some restriction, we give a practical criterion for the discrete dual of such bicrossed products to have the rapid decay…

Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…

The global structure of the unbounded derived category of a truncated polynomial ring on countably many generators is investigated, via its Bousfield lattice. The Bousfield lattice is shown to have cardinality larger than that of the real…

This is a survey about the contruction of warped products between (semi-)Riemannian manifolds and metric (measure) spaces. The resulting spaces will be semi-Riemannian manifolds, metric (measure) spaces or Lorentzian metric and metric…

A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…

In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained girth and in the high-rate regime. We focus on the relation…

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…