Related papers: Holomorphic subgraph reduction of higher-point mod…
Clustering heterogeneous relational data remains a central challenge in graph learning, particularly when interactions involve more than two types of entities. While differentiable modularity objectives such as DMoN have enabled end-to-end…
We provide a natural generalization to submanifolds of the holographic method used to extract higher-order local invariants of both Riemannian and conformal embeddings, some of which depend on a choice of parallelization of the normal…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
In this paper we give a new characterization of the h-vector of the chromatic polynomial of a graph. We introduce reduced chromatic cohomology of a graph and show that h_i are its Betti numbers. We then discuss various combinatorial…
A number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…
Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \cite{KZ:PAMI04} has had significant impact in computer vision \cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}.…
Downsampling produces coarsened, multi-resolution representations of data and it is used, for example, to produce lossy compression and visualization of large images, reduce computational costs, and boost deep neural representation…
$\mathcal{H}-$holomorphic curves are solutions of a specific modification of the pseudoholomorphic curve equation in symplectizations involving a harmonic $1-$form as perturbation term. In this paper we compactify the moduli space of…
Modular graph functions arise in the calculation of the low-energy expansion of closed-string scattering amplitudes. For toroidal world-sheets, they are ${\rm SL}(2,\mathbb{Z})$-invariant functions of the torus complex structure that have…
In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…
We connect the homotopy type of simplicial moduli spaces of algebraic structures to the cohomology of their deformation complexes. Then we prove that under several assumptions, mapping spaces of algebras over a monad in an appropriate…
We establish an Eichler-Shimura isomorphism for weakly modular forms of level one. We do this by relating weakly modular forms with rational Fourier coefficients to the algebraic de Rham cohomology of the modular curve with twisted…
Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsification, submodular hypergraph sparsification, general notions…
We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…
Submodular width is a central structural measure governing the complexity of conjunctive query evaluation. In this paper we recast submodular width in geometric terms. We how that submodular width can be approximated, up to a factor $3/2$,…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…