Related papers: Jamming and geometric representations of graphs
We investigate universal features of the jamming transition in granular materials, colloids and glasses. We show that the jamming transition in these systems has common features: slowing of response to external perturbation, and the onset…
A recent body of work has demonstrated that Transformer embeddings can be linearly decomposed into well-defined sums of factors, that can in turn be related to specific network inputs or components. There is however still a dearth of work…
Amorphous materials as diverse as foams, emulsions, colloidal suspensions and granular media can {\em jam} into a rigid, disordered state where they withstand finite shear stresses before yielding. The jamming transition has been studied…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
In this paper, we study the embedded topology of smooth plane quartics and its bitangent lines via two-graphs and apply it to construct interesting examples for Zariski $m$-ple.
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
We consider the question of whether a given graph drawing $\Gamma$ of a triconnected planar graph $G$ is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of $\Gamma$. This…
\citet{Shmuel2016JMPS} discovered that all infinite band structures of waves at normal incidence in two-phase laminates are encapsulated in a compact universal manifold. We show that manifolds of higher dimensionality encapsulate the band…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
Hyperuniformity characterizes a state of matter that is poised at a critical point at which density or volume-fraction fluctuations are anomalously suppressed at infinite wavelengths. Recently, much attention has been given to the link…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
The connection between the theory of permutation orbifolds, covering surfaces and uniformization is investigated, and the higher genus partition functions of an arbitrary permutation orbifold are expressed in terms of those of the original…
We experimentally probe the vicinity of the jamming point J, located at a density $\phi$ corresponding to random close packing ($\phi_{rcp} = 0.842$), in two dimensional, bidisperse packings of foam bubbles. We vary the density of the foam…
Packings of frictionless athermal particles that interact only when they overlap experience a jamming transition as a function of packing density. Such packings provide the foundation for the theory of jamming. This theory rests on the…
It is well known that a direct Lagrangian description of radiation damping is still missing. In this paper we will use a specific approach of this problem which is the standard way to treat the radiation damping problem. The objectives here…
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…
We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.
We consider an isomorphism between the idempotent convexity based on the maximum and the addition operations and the idempotent measure convexity on the maximum and the multiplication operations. We use this isomorphism to investigate…