Related papers: Reconsideration of Tangle and Ultrafilter using Se…
Superclusters are a convenient way to partition and characterize the large scale structure of the Universe. In this Letter we explore the advantages of defining superclusters as watershed basins in the divergence velocity field. We apply…
A promising strategy for better understanding space and time at the Planck scale, is outlined and further pursued. It is explained in detail, how black hole unitarity demands the existence of transformations that can remove firewalls. This…
Partition problems in graphs are extremely important in applications, as shown in the Data science and Machine learning literature. One approach is spectral partitioning based on a Fiedler vector, i.e., an eigenvector corresponding to the…
This work aims to define the concept of manifold, which has a very important place in the topology, on digital images. So, a general perspective is provided for two and three-dimensional imaging studies on digital curves and digital…
A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport…
Menasco proved the surprising result that if $G$ is a reduced, alternating, connected projection of a link $L$ and $G$ is prime then $L$ is prime. This result has been generalized to other classes of links, tangles, and spatial graphs. We…
In this note, we first derive a one-parameter family of hyperparameter scaling strategies that interpolates between the neural-tangent scaling and mean-field/maximal-update scaling. We then calculate the scalings of dynamical observables --…
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…
Band theory provides the foundation for understanding electronic structure in crystalline materials, but its reliance on exact translational symmetry limits its applicability to systems with defects, disorder, incommensurate modulations, or…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…
A tangent category is a categorical abstraction of the tangent bundle construction for smooth manifolds. In that context, Cockett and Cruttwell develop the notion of differential bundle which, by work of MacAdam, generalizes the notion of…
Manifolds and fiber bundles, while superficially different, have strong parallels; in particular, they are both defined in terms of equivalence classes of atlases or in terms of maximal atlases, with the atlases treated as mere adjuncts.…
Document structure analysis, such as zone segmentation and table recognition, is a complex problem in document processing and is an active area of research. The recent success of deep learning in solving various computer vision and machine…
A fundamental algorithmic problem in computational biology is to find all subgraphs of a given type (superbubbles, snarls, and ultrabubbles) in a directed or bidirected input graph. These correspond to regions of genetic variation and are…