相关论文: Jamming and geometric representations of graphs
We show that the maximum entropy hypothesis can successfully explain the distribution of stresses on compact clusters of particles within disordered mechanically stable packings of soft, isotropically stressed, frictionless disks above the…
The paper presents the bosonic and fermionic supersymmetric extensions of the structural equations describing conformally parametrized surfaces immersed in a Grasmann superspace, based on the authors' earlier results. A detailed analysis of…
We formalize symmetry breaking as a set-covering problem. For the case of breaking symmetries on graphs, a permutation covers a graph if applying it to the graph yields a smaller graph in a given order. Canonical graphs are those that…
Graph signals arise in various applications, ranging from sensor networks to social media data. The high-dimensional nature of these signals implies that they often need to be compressed in order to be stored and transmitted. The common…
We examine the structure of Farey maps, which are a class of maps (graph embeddings on surfaces) that have received significant attention recently. We describe how they are related to each other through regular coverings and parallel…
We survey some principal results and open problems related to colorings of geometric and algebraic objects endowed with symmetries, concentrating the exposition on the maximal symmetry numbers of such objects.
We use numerical Monte Carlo simulation to study kinetics of deposition of oriented superdisks, bounded by the Lame curves of the form $|x|^{2p}+|y|^{2p}=1$, on regular planar substrate. It was recently shown that the maximum packing…
In this paper we address the problem of estimating the operator norm of the embeddings between multidimensional weighted Paley-Wiener spaces. These can be equivalently thought as Fourier uncertainty principles for bandlimited functions. By…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
The jamming of bi-disperse soft core disks is considered, using a variety of different protocols to produce the jammed state. In agreement with other works, we find that cooling and compression can lead to a broad range of jamming packing…
The Tutte polynomial is a generalization of the chromatic polynomial of graph colorings. Here we present an extension called the rooted Tutte polynomial, which is defined on a graph where one or more vertices are colored with prescribed…
Disks of two sizes and weights in alternating sequence are confined to a long and narrow channel. The axis of the channel is horizontal and its plane vertical. The channel is closed off by pistons that freeze jammed microstates out of loose…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
A general framework is presented which unifies the treatment of wavelet-like, quasidistribution, and tomographic transforms. Explicit formulas relating the three types of transforms are obtained. The case of transforms associated to the…
Because of the open access nature of wireless communications, wireless networks can suffer from malicious activity, such as jamming attacks, aimed at undermining the network's ability to sustain communication links and acceptable…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…