Related papers: Split rank of triangle and quadrilateral inequalit…
We study several models of random geometric subdivisions arising from the model of Diaconis and Miclo (2011). In particular, we show that the limiting shape of an indefinite subdivision of a quadrilateral is a.s.\ a parallelogram. We also…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free…
We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…
Given a combinatorial optimization problem $\Pi$ and an increasing finite sequence $c$ of natural numbers, we obtain a cardinality constrained version $\Pi_c$ of $\Pi$ by permitting only those feasible solutions of $\Pi$ whose cardinalities…
The row (resp. column) rank profile of a matrix describes the stair-case shape of its row (resp. column) echelon form. We here propose a new matrix invariant, the rank profile matrix, summarizing all information on the row and column rank…
Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity…
We consider the most general correlations that can be obtained by a group of parties whose causal relations are well-defined, although possibly probabilistic and dependent on past parties' operations. We show that, for any fixed number of…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…
Despite the moduli space of triangles being three dimensional, we prove the existence of two triangles which are not isometric to each other for which the first, second and fourth Dirichlet eigenvalues coincide, establishing a numerical…
We study the rank-three lifting problem for incidence matrices of finite projective planes through residue-level determinant constraints invisible to tropical valuations alone. In residue characteristic $\neq 3$, any rank-$\le 3$ lift of…
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based on identifying vertex covers of the conflict graph of the…
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form $S:=\{x : \pi_0 \leq \pi^T x \leq \pi_0+1 \}$ called split sets. The set obtained by adding all split…
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…
In 1994, Martin Gardner stated a set of questions concerning the dissection of a square or an equilateral triangle in three similar parts. Meanwhile, Gardner's questions have been generalized and some of them are already solved. In the…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…