English
Related papers

Related papers: Holomorphic subgraph reduction of higher-point mod…

200 papers

In this note, we describe several new examples of holomorphic modular forms on the group SU(2,1). These forms are distinguished by having weight $\frac{1}{3}$. We also describe a method for determining the levels at which one should expect…

Number Theory · Mathematics 2022-03-03 Eberhard Freitag , Richard M. Hill

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

Computational Complexity · Computer Science 2011-08-09 Michael Kowalczyk , Jin-Yi Cai

A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…

Number Theory · Mathematics 2007-05-23 P. Bantay , T. Gannon

We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel…

Machine Learning · Computer Science 2013-09-11 K. S. Sesh Kumar , Francis Bach

To a graph, Hausel and Proudfoot associate two complex manifolds, B and D, which behave, respectively like moduli of local systems on a Riemann surface, and moduli of Higgs bundles. For instance, B is a moduli space of microlocal sheaves,…

Algebraic Geometry · Mathematics 2022-10-11 Zsuzsanna Dancso , Michael McBreen , Vivek Shende

Every oriented 4-manifold admits a folded symplectic structure, which in turn determines a homotopy class of compatible almost complex structures that are discontinuous across the folding hypersurface ("fold") in a controlled fashion. We…

Symplectic Geometry · Mathematics 2014-11-11 Jens von Bergmann

A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…

Machine Learning · Computer Science 2026-03-04 Martin Carrasco , Olga Zaghen , Kavir Sumaraj , Erik Bekkers , Bastian Rieck

Superconformal indices of four-dimensional $\mathcal{N}=1$ gauge theories factorize into holomorphic blocks. We interpret this as a modular property resulting from the combined action of an $SL(3,\mathbb{Z})$ and $SL(2,\mathbb{Z})\ltimes…

High Energy Physics - Theory · Physics 2023-08-22 Vishnu Jejjala , Yang Lei , Sam van Leuven , Wei Li

In this paper, we first prove that when the associated graph of a polynomial set is chordal, a particular triangular set computed by a general algorithm in top-down style for computing the triangular decomposition of this polynomial set has…

Symbolic Computation · Computer Science 2018-11-28 Chenqi Mou , Yang Bai , Jiahua Lai

The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…

Algebraic Geometry · Mathematics 2007-05-23 V. P. Palamodov

We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…

Discrete Mathematics · Computer Science 2018-12-04 Carenne Ludena , Miguel mendez , Nicolas Bolivar

We relate the low-energy expansions of world-sheet integrals in genus-one amplitudes of open- and closed-string states. The respective expansion coefficients are elliptic multiple zeta values in the open-string case and non-holomorphic…

High Energy Physics - Theory · Physics 2021-06-15 Jan E. Gerken , Axel Kleinschmidt , Carlos R. Mafra , Oliver Schlotterer , Bram Verbeek

We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…

Differential Geometry · Mathematics 2026-04-07 Chung-Jun Tsai , Mu-Tao Wang

In this work we present a three step procedure for generating a closed form expression of the Green's function on both closed and open finite quantum graphs with general self-adjoint matching conditions. We first generalize and simplify the…

Quantum Physics · Physics 2023-09-21 Tristan Lawrie , Sven Gnutzmann , Gregor Tanner

The restrictions of target--space duality are imposed at the perturbative level on the holomorphic Wilsonian couplings that encode certain higher-order gravitational interactions in $N=2, D=4$ heterotic string compactifications. A crucial…

High Energy Physics - Theory · Physics 2009-10-07 Bernard de Wit , Gabriel Lopes Cardoso , Dieter Lüst , Thomas Mohaupt , Soo-Jong Rey

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lov\'asz extension. The polar…

Optimization and Control · Mathematics 2020-12-09 Alper Atamturk , Vishnu Narayanan

Modular graph functions are $SL(2,{\mathbb Z})$-invariant functions associated with Feynman graphs of a two-dimensional conformal field theory on a torus of modulus $\tau$. For one-loop graphs they reduce to real analytic Eisenstein series.…

High Energy Physics - Theory · Physics 2021-02-09 Eric D'Hoker , Justin Kaidi

In this lecture we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. Our analysis is based on an approach to modular invariants using braided sector induction…

Operator Algebras · Mathematics 2007-05-23 J. Böckenhauer , D. E. Evans

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

Discrete Mathematics · Computer Science 2014-11-10 Pascal Schweitzer

Higher-Order Hypergraph Learning (HOHL) was recently introduced as a principled alternative to classical hypergraph regularization, enforcing higher-order smoothness via powers of multiscale Laplacians induced by the hypergraph structure.…

Machine Learning · Computer Science 2025-11-25 Adrien Weihs , Andrea L. Bertozzi , Matthew Thorpe