Related papers: Many rays of the submodular cone
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
Let R be a commutative ring with identity and M be an R-module. In this paper, we will introduce the concept of 2-irreducible (resp., strongly 2- irreducible) submodules of M as a generalization of irreducible (resp., strongly irreducible)…
For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…
For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…
In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. In particular we generalize the known…
We calculate all the 2 to 2 scattering process in Yang-Mills theory in the Light Cone gauge, with the dimensional regulator as the UV regulator. The IR is regulated with a cutoff in $q^+$. It supplements our earlier work, where a Lorentz…
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
An Ingletonian polymatroid satisfies, in addition to the polymatroid axioms, the inequalities of Ingleton (Combin. Math. Appln., 1971). These inequalities are required for a polymatroid to be representable. It is has been an open question…
A-polynomials were introduced by Meyn and play an important role in the iterative construction of high degree self-reciprocal irreducible polynomials over the field F_2, since they constitute the starting point of the iteration. The exact…
For a positive integer $n\geq 3$, the sides and diagonals of a convex $n$-gon divide the interior of the convex $n$-gon into finitely (polynomial in $n$) many regions bounded by them. In this article, we associate to every region a unique…
In Part I we gave a polynomial growth lower-bound for the number of nodal domains of a Hecke-Maass cuspform in a compact part of the modular surface, assuming a Lindel\"of hypothesis. That was a consequence of a topological argument and…
The problem of classifying high-dimensional shapes in real-world data grows in complexity as the dimension of the space increases. For the case of identifying convex shapes of different geometries, a new classification framework has…
The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…
Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…
In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than $\sqrt{2+\sqrt{5}}$. In this paper, after giving a new version of Hoffman's theorem, we…
In 2007, G.E. Andrews introduced the $(n+1)$-variable combinatorial generating function $R_n(x_1,x_2,\cdots,x_n;q)$ for ranks of $n$-marked Durfee symbols, an $(n+1)$-dimensional multisum, as a vast generalization to the ordinary…
Let $X$ be an orthogonal Shimura variety associated to a unimodular lattice. We investigate the polyhedrality of the cone $\mathcal{C}_X$ of special cycles of codimension 2 on $X$. We show that the rays generated by such cycles accumulate…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious with respect to querying the submodular function, for both the…