Related papers: Counting Bubbles in Linear Chord Diagrams
An exact solution is developed for the bubble-induced acoustic microstreaming in the case of a gas bubble undergoing asymmetric oscillations. The modeling is based on the decomposition of the solenoidal, first- and second-order, vorticity…
Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal in this type of clustering is to minimize the number of…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
A network of coupled time-varying systems, where individual nodes are interconnected through links, is a modeling framework widely used by many disciplines. For identical nodes displaying a complex behavior known as chaos, clusters of nodes…
Given an initial configuration of pebbles on a graph, one can move pebbles in pairs along edges, at the cost of one of the pebbles moved, with the objective of reaching a specified target vertex. The pebbling number of a graph is the…
The mathematics of musical intervals and scales has been extensively studied. Vastly simplified, our ears seem to prefer intervals whose frequency ratios have small numerator and denominator, such as 2:1 (octave), 3:2 (perfect fifth), 4:3…
In this paper, it is shown that in interaction with an oscillating bubbles cluster the fluid becomes inhomogeneous. The radial variation of the acoustic refractive index of the fluid generates an acoustic lens with spherical symmetry. When…
For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…
The dispersed phase in liquid-liquid emulsions and air-liquid mixtures can often be fragmented into smaller sizes by the surrounding turbulent carrier phase. The critical parameter that controls this process is the breakup frequency, which…
We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…
Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To…
Chord diagrams, under the name of Gauss diagrams, are used in low-dimensional topology as an important tool for studying curves or knots. Those Gauss diagrams that correspond to curves or knots are called realizable. The theme of our paper…
Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to…
Acoustically excited bubbles are involved in a wide range of phenomena and applications ranging from oceanography to sonoluminescence; they have applications in chemistry, medical imaging, and therapeutic ultrasound. The complexity of…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
A model of nonlinear resonance as a periodically perturbed pendulum is considered, and a new method of analytical estimating the width of a chaotic layer near the separatrices of the resonance is derived for the case of slow perturbation…
The number of nodes of a network, called its size, and the largest distance between nodes of a network, called its diameter, are among the most important network parameters. Knowing the size and/or diameter is a prerequisite of many…
We define a complete invariant for doodles on a 2-sphere which takes values in series of chord diagrams of certain type. The coefficients at the diagrams with $n$ chords are finite type invariants of doodles of order at most $2n$.
A chorded cycle is a cycle with at least one chord. Gould asked in [Graphs Comb. 38 (2022) 189] the question: What spectral conditions imply a graph contains a chorded cycle? For a graph with fixed size, extremal spectral conditions are…
A Gauss diagram (or, more generally, a chord diagram) consists of a circle and some chords inside it. Gauss diagrams are a well-established tool in the study of topology of knots and of planar and spherical curves. Not every Gauss diagram…