Related papers: Simplex Layers and Phase Boundaries in the Partiti…

Multilayer graphs are appealing mathematical tools for modeling multiple types of relationship in the data. In this paper, we aim at analyzing multilayer graphs by properly combining the information provided by individual layers, while…

The observation of stacks of distinct layers in a colloidal or liquid mixture in sedimentation-diffusion equilibrium is a striking consequence of bulk phase separation. Drawing quantitative conclusions about the phase diagram is, however,…

The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1) We cut every edge of G into two halves, thus obtaining a…

The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1.…

We investigate the notion of symplectic divisorial compactification for symplectic 4-manifolds with either convex or concave type boundary. This is motivated by the notion of compactifying divisors for open algebraic surfaces. We give a…

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

Let ${\mathcal M}_g$ be the moduli space of compact connected Riemann surfaces of genus $g\geq 2$ and let $\widehat{{\mathcal M}_g}$ be its Deligne-Mumford compactification, which is stratified by the topological type of the stable Riemann…

Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as…

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

Let $G=(V,E)$ be a graph on $n$ vertices, and let $\lambda_1(L(G))\ge \cdots\ge \lambda_{n-1}(L(G))\ge \lambda_n(L(G))=0$ be the eigenvalues of its Laplacian matrix $L(G)$. Brouwer conjectured that for every $1\le k\le n$, $\sum_{i=1}^k…

We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…

This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…

For a finite point set in $\mathbb{R}^d$, we consider a peeling process where the vertices of the convex hull are removed at each step. The layer number $L(X)$ of a given point set $X$ is defined as the number of steps of the peeling…

Let X be the moduli space of SL(n,C), SU(n), GL(n,C), or U(n)-valued representations of a rank r free group. We classify the algebraic singular stratification of X. This comes down to showing that the singular locus corresponds exactly to…

Starting with a finite point set $X \subset \mathbf{R}^d$, the peeling process repeatedly removes the set of the vertices of the convex hull of the current set. The number of peeling steps required to completely remove $X$ is called the…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

Galaxy diversification proceeds by transforming events like accretion, interaction or mergers. These explain the formation and evolution of galaxies that can now be described with many observables. Multivariate analyses are the obvious…

In this paper we study variants of the widely used spectral clustering that partitions a graph into k clusters by (1) embedding the vertices of a graph into a low-dimensional space using the bottom eigenvectors of the Laplacian matrix, and…

The main goal in distributed symmetry-breaking is to understand the locality of problems; i.e., the radius of the neighborhood that a node needs to explore in order to arrive at its part of a global solution. In this work, we study the…

We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by…