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

We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Specifically, we study the directed tile complexity of a $k…

We obtain results on the geometry of D-semianalytic and subanalytic subsets over a complete, non-trivially valued non-Archimedean field K, which is not necessarily algebraically closed. Among the results are a parameterized smooth…

Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…

We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities…

We consider the random regular $k$-NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_0$, we establish explicitly the satisfiability threshold $d_*=d_*(k)$. We prove that…

Let $A$ be a finite dimensional hereditary algebra over a field $k$ and $A^{(1)}$ the duplicated algebra of $A$. We first show that the global dimension of endomorphism ring of tilting modules of $A^{(1)}$ is at most 3. Then we investigate…

In this paper we state the homological domination principle for random multi-parameter simplicial complexes, claiming that the Betti number in one specific dimension (which is explicitly determined by the probability multi-parameter)…

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

For any odd $n$, we describe a smooth minimal (i.e. obtained by adding an irreducible hypersurface) compactification $\tilde S_n$ of the quasi-projective homogeneous variety $S_{n}=PGL(n+1)/SL(2)$ that parameterizes the rational normal…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

Let X be a smooth complex projective manifold of dimension n equipped with an ample line bundle L and a rank k holomorphic vector bundle E. We assume that 0< k <=n, that X, E and L are defined over the reals and denote by RX the real locus…

In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…

In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

For $N$ compatible substitution rules on $M$ prototiles $t_1,\dots,t_M$, consider tilings and tiling spaces constructed by applying the different substitution rules at random. These give (globally) random substitution tilings. In this paper…

We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/sqrt(d) pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a…

We study certain random simplicial complexes, called random quota complexes. A quota complex on $N+1$ weighted vertices is constructed by adding an $n$-simplex if the sum of the weights of the vertices is below a given quota, $q$. In this…

We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable)…