Related papers: Counting Bubbles in Linear Chord Diagrams
We enumerate the number of $T$-splitting subspaces of dimension $m$ for an arbitrary operator $T$ on a $2m$-dimensional vector space over a finite field. When $T$ is regular split semisimple, comparison with an alternate method of…
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of…
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
In this paper we study locally chordal graphs, i.e. graphs where every small-radius ball is chordal. We prove four characterizations of locally chordal graphs. Two are counterparts of the classic descriptions of chordal graphs via induced…
We report acoustic experiments on foam systems. We have recorded the sound emitted by crackling cells during the collapsing of foams. The sound pattern is then analyzed using classical methods of statistical physics. Fundamental processes…
A graphic arrangement is a subarrangement of the braid arrangement whose set of hyperplanes is determined by an undirected graph. A classical result due to Stanley, Edelman and Reiner states that a graphic arrangement is free if and only if…
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…
We describe a proof-of-principle implementation of a system for drawing melodies that abstracts away from a note-level input representation via melodic contours. The aim is to allow users to express their musical intentions without…
Bubble-sort star graphs are a combination of star graphs and bubble sort graphs. They are bipartite graphs and also form a family of Cayley graphs. The decycling number of a graph is the minimum number of vertices whose removal from the…
It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees…
We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We…
Analytical expressions for the distribution of the length of chords corresponding to the affine invariant measure on the set of chords are given for convex polygons. These analytical expressions are a computational improvement over other…
A generic immersion of a circle into a $2$-sphere is often studied as a projection of a knot; it is called a knot projection. A chord diagram is a configuration of paired points on a circle; traditionally, the two points of each pair are…
A chordless cycle (induced cycle) $C$ of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Using a measure of clustering derived from the nearest neighbour distribution and the void probability function we are able to distinguish between regular and clustered structures. With an example we show that regularity is a property of a…
The statistical precision of a chord method for estimating fractal dimension from a correlation integral is derived. The optimal chord length is determined, and a comparison is made to other estimators. These calculations use the…
We demonstrate experimentally that the introduction of a rail, a small height constriction, within the cross-section of a rectangular channel could be used as a robust passive sorting device in two-phase fluid flows. Single air bubbles…