Related papers: Tilings, packings and expected Betti numbers in si…

It has been known for almost 200 years that some angles cannot be trisected by straightedge and compass alone. This paper studies the set of such angles as well as its complement $\mathcal{T}$, both regarded as subsets of the unit circle…

Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…

We investigate convergence of martingales adapted to a given filtration of finite $\sigma$-algebras. To any such filtration we associate a canonical metrizable compact space $K$ such that martingales adapted to the filtration can be…

In this paper we describe the multiplier ideals and jumping numbers associated with an irreducible germ of quasi-ordinary hypersurface $(D, 0) \subset (\mathbb{C}^{d+1}, 0)$ by using a toroidal embedded resolution. The approach is motivated…

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…

We study the differential inclusion $Du\in K$, where $K$ is an unbounded and rotationally invariant subset of the real symmetric $3\times 3$ matrices. We exhibit a subset of all possible average fields. The corresponding microgeometries are…

For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…

Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…

The purpose of this paper is to show that the multiplicities of a discrete series representation relatively to a compact subgroup can be "computed" geometrically, in the way predicted by the "qantization commutes with reduction" principle…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

A basic goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems $f\colon(\{0,1\}^n)^{k}\to\{0,1\}$ with $k\gg\log n$ parties. We study the problems of inner product and set disjointness and…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…

Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…

In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…

Let $R$ be a regular ring of dimension $d$ and $L$ be a $c$-divisible monoid. If ${K}_1{Sp}(R)$ is trivial and $k \geq d+2,$ then we prove that the symplectic group ${Sp}_{2k}(R[L])$ is generated by elementary symplectic matrices over…

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…