Related papers: Jump and Gradient Invariants in the Partition Grap…

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

Learning generative models for graph-structured data is challenging because graphs are discrete, combinatorial, and the underlying data distribution is invariant to the ordering of nodes. However, most of the existing generative models for…

Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…

Let $f:X\to X $ be a dominant self-morphism of an algebraic variety over an algebraically closed field of characteristic zero. We consider the set $\Sigma_{f^{\infty}}$ of $f$-periodic (irreducible closed) subvarieties of small dynamical…

A vertex partition in which every part induces a 2-connected subgraph is called a 2-proper partition. This concept was introduced by Ferrara et al. in 2013, and Borozan et al. gave the best possible minimum degree condition for the…

We study the graded derivation-based noncommutative differential geometry of the $Z_2$-graded algebra ${\bf M}(n| m)$ of complex $(n+m)\times(n+m)$-matrices with the ``usual block matrix grading'' (for $n\neq m$). Beside the…

We use augmented commutative differential graded algebra (ACDGA) models to study $G$-representation varieties of fundamental groups $\pi=\pi_1(M)$ and their embedded cohomology jump loci, around the trivial representation 1. When the space…

For a graph $G$, let $\nu_s(G)$ be the induced matching number of $G$. We prove that $\nu_s(G) \geq \frac{n(G)}{(\lceil\frac{\Delta}{2}\rceil+1) (\lfloor\frac{\Delta}{2}\rfloor+1)}$ for every graph of sufficiently large maximum degree…

Geometric Invariant Theory gives a method for constructing quotients for group actions on algebraic varieties which in many cases appear as moduli spaces parametrizing isomorphism classes of geometric objects (vector bundles, polarized…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

Fragmentation population-balance equations (PBEs) describe how particle size distributions (PSDs) evolve under breakage and daughter fragment redistribution. From a standard self-similar fragmentation class we derive an \emph{exact…

We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…

Two permutations of the vertices of a graph $G$ are called $G$-different if there exists an index $i$ such that $i$-th entry of the two permutations form an edge in $G$. We bound or determine the maximum size of a family of pairwise…

We propose a local-to-global representation learning algorithm for 3D point cloud data, which is appropriate to handle various geometric transformations, especially rotation, without explicit data augmentation with respect to the…

We study how Gromov-Witten invariants of projective 3-folds transform under a standard flop and a small extremal transition in the algebro-geometric setting from the recent development of algebraic relative Gromov-Witten theory and its…

The goal of graph summarization is to represent large graphs in a structured and compact way. A graph summary based on equivalence classes preserves pre-defined features of a graph's vertex within a $k$-hop neighborhood such as the vertex…

We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…

We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…