Related papers: The heat semigroup and Brownian motion on strip co…
In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose…
We review briefly several approaches used to investigate the stability of stripe phases in high temperature superconductors, where charge inhomogeneities arise from competing kinetic and magnetic energies. The mechanism of stripe formation,…
We define a chain complex for generalized splines on graphs, analogous to that introduced by Billera and refined by Schenck-Stillman for splines on polyhedral complexes. The hyperhomology of this chain complex yields bounds on the…
We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
The Dehn property for a complex is that every non-trivial disk diagram has spurs or shells. It implies a linear isoperimetric inequality. It has been conjectured that the same is true of a more general property which also allows cutcells.…
The purpose of this paper is to analyze the degree index and clustering index in random graphs. The degree index in our setup is a certain measure of degree irregularity whose basic properties are well studied in the literature, and the…
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
Motivated by recent experiments in KTaO$_3$/EuO interface, we propose an intrinsic mechanism where superconducting stripes emerge naturally without involving disorder, charge inhomogeneity, or competing orders. Our theory is based on a…
We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…
In this work we develop a novel fully discrete version of the plates complex, an exact Hilbert complex relevant for the mixed formulation of fourth-order problems. The derivation of the discrete complex follows the discrete de Rham…
We study a generic model of self-assembling chains which can branch and form networks with branching points (junctions) of arbitrary functionality. The physical realizations include physical gels, wormlike micells, dipolar fluids and…
Two coarse-grained models which capture some universal characteristics of stripe forming systems are stud- ied. At high temperatures, the structure factors of both models attain their maxima on a circle in reciprocal space, as a consequence…
Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. In…
A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
Suppose that a finite group $G$ acts on a smooth complex variety $X$. Then this action lifts to the Chiral de Rham Complex of $X$ and to its cohomology by automorphisms of the vertex algebra structure. We define twisted sectors for the…
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…