Related papers: Connectivity Functions and Polymatroids
It follows by Bixby's Lemma that if $e$ is an element of a $3$-connected matroid $M$, then either ${\rm co}(M\delete e)$, the cosimplification of $M\delete e$, or ${\rm si}(M/e)$, the simplification of $M/e$, is $3$-connected. A natural…
As a development of arXiv:1912.12897, we note that the ordinary Shiraishi functions have an insufficient number of parameters to describe generic eigenfunctions of double elliptic system (Dell). The lacking parameter can be provided by…
Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…
We study Appell functions associated to an arbitrary positive definite lattice $\Lambda$ and a choice of $M\leq {\rm dim}(\Lambda)$ linearly independent vectors $d_r\in \Lambda$, $r=1,\dots,M$. These functions are instances of…
For a rational function $R$, let $N_R(z)=z-\frac{R(z)}{R'(z)}.$ Any such $N_R$ is referred to as a Newton map. We determine all the rational functions $R$ for which $N_R$ has exactly two attracting fixed points, one of which is an…
The main question here is the possible generalization of the following theorem on ``simple'' equivalence relation on 2^omega to higher cardinals. Theorem: (1) Assume that: (a) E is a Borel 2-place relation on 2^omega, (b) E is an…
Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong…
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
We investigate semiconjugate rational functions, that is rational functions $A,$ $B$ related by the functional equation $A\circ X=X\circ B$, where $X$ is a rational function of degree at least two. We show that if $A$ and $B$ is a pair of…
Submodular functions have many applications. Matchings have many applications. The bitext word alignment problem can be modeled as the problem of maximizing a nonnegative, monotone, submodular function constrained to matchings in a complete…
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…
Let $X$ be a complex smooth projective variety, and $\mathcal{G}$ a locally free sheaf on $X$. We show that there is a 1-to-1 correspondence between pairs $(\Lambda,\Xi)$, where $\Lambda$ is a sheaf of almost polynomial filtered algebras…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible…
Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…
In this article we disprove the conjectures asserting the positivity of the coefficients of the Ehrhart polynomial of matroid polytopes by De Loera, Haws and K\"oppe (2007) and of generalized permutohedra by Castillo and Liu (2015). We…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]