Related papers: Counting Bubbles in Linear Chord Diagrams
The spontaneous formation of tiny bubbles in a liquid is at the root of the nucleation mechanism during the liquid-to-vapor transition of a metastable liquid. The smaller the bubbles the larger their probability to appear, and even for…
We explore geometric aspects of bubble convergence for harmonic maps. More precisely, we show that the formation of bubbles is characterised by the local excess of curvature on the target manifold. We give a universal estimate for curvature…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…
We prove that the class of chordal graphs is easily testable in the following sense. There exists a constant $c>0$ such that, if adding/removing at most $\epsilon n^2$ edges to a graph $G$ with $n$ vertices does not make it chordal, then a…
The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…
The scattering of ultrasound from bubbles of micrometer-sized radius, such as used in contrast enhancers for ultrasound diagnostics, is studied. We show that sound scattering and ``active'' emission of sound from oscillating bubbles are not…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
We investigate properties of the correlation function of clusters of galaxies using geometrical models. On small scales the correlation function depends on the shape and the size of superclusters. On large scales it describes the geometry…
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph, gamma(G), is the smallest…
Graph pebbling is the study of moving discrete pebbles from certain initial distributions on the vertices of a graph to various target distributions via pebbling moves. A pebbling move removes two pebbles from a vertex and places one pebble…
A 2D foam can be characterised by its distribution of bubble areas, and of number of sides. Both distributions have an average and a width (standard deviation). There are therefore at least two very different ways to characterise the…
In this paper, the size of bubbles formed through the breakup of a gaseous jet in a co-axial microfluidic device is derived. The gaseous jet surrounded by a co-flowing liquid stream breaks up into monodisperse microbubbles and the size of…
In this paper, we study the notion of chordality and cycles in hypergraphs from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. However, there is no…
We study random bubble lattices which can be produced by processes such as first order phase transitions, and derive characteristics that are important for understanding the percolation of distinct varieties of bubbles. The results are…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves.…
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and…