English
Related papers

Related papers: Convergent sequences of combinatorial submodular s…

200 papers

The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…

Category Theory · Mathematics 2020-12-03 Chris Heunen , Vaia Patta

We show that, for a class of locally solid topologies on vector lattices, a topologically convergent net has an embedded sequence that is unbounded order convergent to the same limit. Our result implies, and often improves, many of the…

Functional Analysis · Mathematics 2024-03-25 Yang Deng , Marcel de Jeu

Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…

Systems and Control · Electrical Eng. & Systems 2025-08-29 Ron Ofir , Ji Liu , A. Stephen Morse , Brian D. O. Anderson

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

Combinatorics · Mathematics 2021-02-16 Michał Lasoń , Małgorzata Sulkowska

The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…

Combinatorics · Mathematics 2013-03-13 Jaroslav Nesetril , Patrice Ossona De Mendez

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

Combinatorics · Mathematics 2017-09-05 Kristóf Bérczi , András Frank

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun

Robust Optimization is becoming increasingly important in machine learning applications. This paper studies the problem of robust submodular minimization subject to combinatorial constraints. Constrained Submodular Minimization arises in…

Machine Learning · Computer Science 2020-01-28 Rishabh Iyer

It is well-known that the Ap\'ery sequences which arise in the irrationality proofs for $\zeta(2)$ and $\zeta(3)$ satisfy many intriguing arithmetic properties and are related to the $p$th Fourier coefficients of modular forms. In this…

Number Theory · Mathematics 2020-02-19 Dermot McCarthy , Robert Osburn , Armin Straub

If we consider a sequence of warped product length spaces, what conditions on the sequence of warping functions implies compactness of the sequence of distance functions? In particular, we want to know when a subsequence converges to a well…

Differential Geometry · Mathematics 2024-09-12 Brian Allen , Bryan Sanchez , Yahaira Torres

In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids…

Combinatorics · Mathematics 2016-07-18 Shamik Ghosh , Raibatak Sen Gupta , M. K. Sen

We construct analogs of the embedding of orthogonal and symplectic groups into unitary groups in the context of fusion categories. At least some of the resulting module categories also appear in boundary conformal field theory. We determine…

Operator Algebras · Mathematics 2011-08-09 Hans Wenzl

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

Combinatorics · Mathematics 2014-03-13 Svante Janson , Andrew J. Uzzell

We derive modular parametrizations for certain infinite series whose summands involve central binomial coefficients and higher-order harmonic numbers. When the rates of convergence are certain rational numbers, modularity allows us to…

Number Theory · Mathematics 2026-03-04 Zhi-Wei Sun , Yajun Zhou

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

Combinatorics · Mathematics 2014-06-25 Matthew Burke , Tony Perkins

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…

Machine Learning · Computer Science 2024-04-15 Mustafa Hajij , Ghada Zamzmi , Theodore Papamarkou , Aldo Guzmán-Sáenz , Tolga Birdal , Michael T. Schaub

In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…

General Mathematics · Mathematics 2021-07-13 Raouf Rajab

In this paper convergence theorems for sequences of scalar, vector and multivalued Pettis integrable functions on a topological measure space are proved for varying measures vaguely convergent.

Functional Analysis · Mathematics 2023-07-04 Luisa Di Piazza , Valeria Marraffa , Kazimierz Musial , Anna Rita Sambucini

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

Dynamical Systems · Mathematics 2022-03-30 Daniel Smania

In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…

Combinatorics · Mathematics 2014-01-29 Igor Artemenko