Related papers: The heat semigroup and Brownian motion on strip co…
Division algebras have demonstrated their utility in studying non-associative algebras and their connection to the Standard Model through complex Clifford algebras. This article focuses on exploring the connection between these complex…
It has become obvious that certain singular phenomena cannot be explained by a mere investigation of the configuration space, defined as the solution set of the loop closure equations. For example, it was observed that a particular 6R…
We present a short account of the present experimental situation of stripes in cuprates followed by a review of our present understanding of their ground state and excited state properties. Collective modes, the dynamical structure factor,…
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…
A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
We use Brownian dynamics simulations and theory to study the over-damped spatiotemporal dynamics and pattern formation in a fluid-permeated array of equally spaced, active, elastic filaments that are pinned at one end and free at the other.…
A phase-field approach describing the dynamics of a strained solid in contact with its melt is developed. By rigorous asymptotic analysis we show that the sharp-interface limit of this model recovers the continuum model equations for the…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups. We compare characterizations of superreflexivity in terms of diamond graphs and binary trees. We show that there exist…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social…
We study a new formulation for the eikonal equation |grad u| =1 on a bounded subset of R^2. Considering a field P of orthogonal projections onto 1-dimensional subspaces, with divergence bounded in L^2, we prove existence and uniqueness for…
We present the discrete version of heat kernel smoothing on graph data structure. The method is used to smooth data in an irregularly shaped domains in 3D images. New statistical properties are derived. As an application, we show how to…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…