English
Related papers

Related papers: Base Modulus for Matroid Truncation, Strength, and…

200 papers

We analyze modular invariance drawing inspiration from tauberian theorems. Given a modular invariant partition function with a positive spectral density, we derive lower and upper bounds on the number of operators within a given energy…

High Energy Physics - Theory · Physics 2020-01-08 Baur Mukhametzhanov , Alexander Zhiboedov

We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important…

Data Structures and Algorithms · Computer Science 2018-11-20 Alina Ene , Huy L. Nguyen

One of the main properties of modulus on graphs is Fulkerson duality. In this paper, we study Fulkerson duality for spanning tree modulus. We introduce a new notion of Beurling partition, and we identify two important ones, which correspond…

Combinatorics · Mathematics 2024-04-09 Huy Truong , Pietro Poggi-Corradini

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

Combinatorics · Mathematics 2024-06-10 Kristóf Bérczi , Boglárka Gehér , András Imolay , László Lovász , Tamás Schwarcz

The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface $X(f)$. As $f$ diverges in the moduli space of polynomials,…

Dynamical Systems · Mathematics 2011-11-09 Laura G. DeMarco , Curtis T. McMullen

Until recently, LP relaxations have played a limited role in the design of approximation algorithms for the Steiner tree problem. In 2010, Byrka et al. presented a ln(4)+epsilon approximation based on a hypergraphic LP relaxation, but…

Discrete Mathematics · Computer Science 2011-12-15 Michel X. Goemans , Neil Olver , Thomas Rothvoss , Rico Zenklusen

The Tutte polynomial is a crucial invariant of matroids. The polymatroid Tutte polynomial $\mathscr{T}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In this…

Combinatorics · Mathematics 2023-09-26 Xiaxia Guan , Xian'an Jin , Tamás Kálmán

A bonded particle model is used to explore how variations in the material properties of brittle, isotropic solids affect critical behavior in fragmentation. To control material properties, a new model is proposed which includes breakable…

Soft Condensed Matter · Physics 2023-09-14 Joel T. Clemmer , Mark O. Robbins

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

The main goal of this paper is to prove, in positive characteristic $p$, stability behavior for the graded Betti numbers in the periodic tails of the minimal resolutions of Frobenius powers of the homogeneous maximal ideals for very general…

Commutative Algebra · Mathematics 2023-03-23 Claudia Miller , Hamidreza Rahmati , Rebecca R. G

Let us consider a truncated matroid $M_{\Gamma}^{r}$ of rank $r$ of a graphic matroid of a graph $\Gamma$. The basis for $M_{\Gamma}^{r}$ is the set of the forests with $r$ edges in $\Gamma$. We consider this basis generating function and…

Combinatorics · Mathematics 2020-05-22 Akiko Yazawa

The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…

Logic · Mathematics 2010-05-28 Gido Scharfenberger-Fabian

Grokking -- the abrupt transition from memorization to generalization long after near-zero training loss -- has been studied mainly in single-task settings. We extend geometric analysis to multi-task modular arithmetic, training…

Machine Learning · Computer Science 2026-04-06 Yongzhong Xu

Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a…

Discrete Mathematics · Computer Science 2022-02-10 Alexander Bauer , Shinichi Nakajima

We study varieties associated to hypergraphs from the point of view of projective geometry and matroid theory. We describe their decompositions into matroid varieties, which may be reducible and can have arbitrary singularities by the…

Combinatorics · Mathematics 2025-12-18 Oliver Clarke , Kevin Grace , Fatemeh Mohammadi , Harshit J Motwani

We develop a new theory of maximizing sets in dynamical systems, for the study of ergodic optimization in systems with weak hyperbolicity but where the Ma\~n\'e cohomology lemma does not hold. This leads to new solutions of the Typical…

Dynamical Systems · Mathematics 2026-03-10 Wen Huang , Oliver Jenkinson , Leiye Xu , Yiwei Zhang

The purpose of this paper is to initiate a new attack on Arveson's resistant conjecture, that all graded submodules of the $d$-shift Hilbert module $H^2$ are essentially normal. We introduce the stable division property for modules (and…

Operator Algebras · Mathematics 2011-04-26 Orr Shalit

Baker and Bowler defined a category of algebraic objects called tracts which generalize both partial fields and hyperfields. They also defined a notion of weak and strong matroids over a tract $F$, and proved that if $F$ is perfect, meaning…

Combinatorics · Mathematics 2025-06-30 Matthew Baker , Tianyi Zhang

This paper explores the implications of blocking duality---pioneered by Fulkerson et al.---in the context of $p$-modulus on networks. Fulkerson's blocking duality is an analogue on networks to the method of conjugate families of curves in…

Combinatorics · Mathematics 2021-02-09 Nathan Albin , Jason Clemens , Nethali Fernando , Pietro Poggi-Corradini