Related papers: Models for Configuration Space in a Simplicial Com…
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
In this article we construct various models for singularity categories of modules over differential graded rings. The main technique is the connection between abelian model structures, cotorsion pairs and deconstructible classes, and our…
Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
We construct proper good moduli spaces for moduli stacks of Bridgeland semistable orthosymplectic complexes on a complex smooth projective variety, which we propose as a candidate for compactifying moduli spaces of principal bundles for the…
In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…
We discuss the construction of finite element spaces of differential forms which satisfy the crucial assumptions of the finite element exterior calculus, namely that they can be assembled into subcomplexes of the de Rham complex which admit…
This paper introduces a data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored in a trie whose nodes are in bijection with the faces of the…
For a subspace arrangement over a finite field we study the evaluation code defined on the arrangement's set of points. The length of this code is given by the subspace arrangement's characteristic polynomial. For coordinate subspace…
We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a…
This paper discusses the construction of local bounded commuting projections for discrete subcomplexes of the gradgrad complexes in two and three dimensions, which play an important role in the finite element theory of elasticity (2D) and…
In earlier work we have shown that the moduli space $N$ of flat connections for the (trivial) $\roman{SU(2)}$-bundle on a closed surface of genus $\ell \geq 2$ inherits a structure of stratified symplectic space with two connected strata…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the…
A combinatorial object representing schemas of, possibly skew, perspectives, called {\em a configuration of skew perspective} has been defined in \cite{klik:binom}, \cite{maszko}. Here we develop the theory of configurations generalizing…
We analyze the local structure of the moduli space of semi-stable bundles on a curve. In particular, a complete description of the local structure is given in the rank 2 case. We obtain as a corollary of this analysis new results about the…
We propose a general framework for solving inverse self-assembly problems, i.e. designing interactions between elementary units such that they assemble spontaneously into a predetermined structure. Our approach uses patchy particles as…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…