Related papers: Minimal rational graphs admitting a QHD smoothing
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…
In the present paper, we propose a new discrete surface theory on 3-valent embedded graphs in the 3-dimensional Euclidean space which are not necessarily discretization or approximation of smooth surfaces. The Gauss curvature and the mean…
The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…
Sturmfels-Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K_5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this…
We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the…
A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
In several cases of nonlinear dispersive PDEs, the difference between the nonlinear and linear evolutions with the same initial data, i.e. the integral term in Duhamel's formula, exhibits improved regularity. This property is usually called…
A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…
In this article, we generalize the results discussed in [arXiv:1004.3762] by introducing a genus to generic fibers of Lefschetz fibrations. That is, we give families of relations in the mapping class groups of genus-1 surfaces with…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
We provide an explicit desingularization and study the resulting fiber geometry of elliptically fibered fourfolds defined by Weierstrass models admitting a split A_4 singularity over a divisor of the discriminant locus. Such varieties are…
While Graph Neural Networks (GNNs) excel on graph-structured data, their performance is fundamentally limited by the quality of the observed graph, which often contains noise, missing links, or structural properties misaligned with GNNs'…
In graph signal processing, learning the weighted connections between nodes from a set of sample signals is a fundamental task when the underlying relationships are not known a priori. This task is typically addressed by finding a graph…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for…
Algebraically simply connected surfaces of general type with p_g=q=0 and 1\le K^2\le 4 in positive characteristic (with one exception in K^2=4) are presented by using a Q-Gorenstein smoothing of two-dimensional toric singularities, a…
In this paper, we give a uniqueness theorem for the Dirichlet problem of minimal maps into general Riemannian manifolds with non-positive sectional curvature, improving Theorem 5.2 of Lee-Ooi-Tsui's paper published in J. Geom. Anal.. The…