Related papers: ULD-Lattices and Delta-Bonds
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so…
A lattice Boltzmann algorithm is used to simulate the slow spreading of drops on a surface patterned with slanted micro-posts. Gibb's pinning of the interface on the sides or top of the posts leads to unidirectional spreading over a wide…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We characterize vector lattices in which unbounded order convergence is eventually order bounded. Among other things, the characterization provides a solution to \cite[Probl.23]{Az}.
Among an infinite number of possible folds, nature has chosen only about 1000 distinct folds to form protein structures. Theoretical studies suggest that selected folds are intrinsically more designable than others; these selected folds are…
Order-disorder transitions take place in many physical systems, but observing them in detail in real materials is difficult. In two- or quasi-two-dimensional systems, the transition has been studied by computer simulations and…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We develop the theory of distributive inverse semigroups as the analogue of distributive lattices without top element and prove that they are in a duality with those etale groupoids having a spectral space of identities, where our spectral…
Let L be a lattice ordered effect algebra. We prove that the lattice uniformities on L which make uniformly continuous the operations $\ominus$ and $\oplus$ of L are uniquely determined by their system of neighbourhoods of 0 and form a…
We study the diffusion and submonolayer spreading of chainlike molecules on surfaces. Using the fluctuating bond model we extract the collective and tracer diffusion coefficients D_c and D_t with a variety of methods. We show that…
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…
We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…
We develop a theory for distributed branch points and investigate their role in determining the shape and influencing the mechanics of thin hyperbolic objects. We show that branch points are the natural topological defects in hyperbolic…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…
We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…
Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…