Related papers: Equivalence relations on separated nets arising fr…
We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this…
For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient…
The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1,2] with a network…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
Lattice relaxation in twistronic bilayers with close lattice parameters and almost perfect crystallographic alignment of the layers results in the transformation of moir\'e pattern into a sequence of preferential stacking domains and domain…
Networks are useful representations for complex systems. Especially, heterogeneous and asymmetrical relations commonly found in complex systems can be converted to weighted directed edges between nodes. The disparity filter (Serrano et al.,…
We prove that in every compact space of Delone sets in $\mathbb{R}^d$ which is minimal with respect to the action by translations, either all Delone sets are uniformly spread, or continuously many distinct bounded displacement equivalence…
A new result of G. Cz\'edli states that for an ordered set $P$ with at least two elements and a group $G$, there exists a bounded lattice $L$ such that the ordered set of principal congruences of $L$ is isomorphic to $P$ and the…
Nodal lines (phase singularities, optical vortices) are the generic interference fringes of complex scalar waves. Here, an exact complex solution of the time independent wave equation (Helmholtz equation) is considered, possessing nodal…
This paper presents proof nets for multiplicative-additive linear logic (MALL), called conflict nets. They are efficient, since both correctness and translation from a proof are p-time (polynomial time), and abstract, since they are…
The notions of tree-like loop and Lipschitz tree-like loop were introduced by Hambly and Lyons in their 2010 Annals of Mathematics paper. They showed that the Lipschitz tree-like property determines an equivalence relation on the set of…
We study a class of discontinuous vector fields brought to our attention by multi-legged animal locomotion. Such vector fields arise not only in biomechanics, but also in robotics, neuroscience, and electrical engineering, to name a few…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
Band flattening has been identified as key ingredient to correlation phenomena in Moir\'e materials and beyond. Here, we examine strongly repulsive fermions on a ladder -- a minimal platform for unconventional $d$-wave pairing -- and show…