Related papers: Base Modulus for Matroid Truncation, Strength, and…
We produce the first regular unimodular triangulation of an arbitrary matroid base polytope. We then extend our triangulation to integral generalized permutahedra. Prior to this work it was unknown whether each matroid base polytope…
The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled…
The global-in-time existence and uniqueness of bounded weak solutions to a spinorial matrix drift-diffusion model for semiconductors is proved. Developing the electron density matrix in the Pauli basis, the coefficients (charge density and…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
In this paper we study compactifications of heterotic string theory on manifolds satisfying the ddbar-lemma. We consider the Strominger system description of the low energy supergravity to first order in alpha' and show that the moduli of…
We summarize our recent efforts to develop the Density Matrix Renormalization Group (DMRG) method into a practical truncation strategy for large-scale nuclear shell model calculations. Following an overview of the essential features of the…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
Strong magnetic fields such as those found on white dwarfs have significant effects on the electronic structure of atoms and molecules. However, the vast majority of molecular studies in the literature in such fields are carried out with…
We study the following problem: Given a variable of interest, we would like to find a best linear predictor for it by choosing a subset of $k$ relevant variables obeying a matroid constraint. This problem is a natural generalization of…
Finding dense subgraphs of a large graph is a standard problem in graph mining that has been studied extensively both for its theoretical richness and its many practical applications. In this paper we introduce a new family of dense…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related…
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…
To every toric ideal one can associate an oriented matroid structure, consisting of a graph and another toric ideal, called bouquet ideal. The connected components of this graph are called bouquets. Bouquets are of three types; free, mixed…
In this work, we investigate the consistency of a perturbative definition of the S-matrix in a particular class of non-Lagrangian theories. We focus on the $p$-form theories proposed in \cite{Broccoli:2021pvv}, which are fully defined by…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…
We characterize the entire functions $P$ of $d$ variables, $d\ge 2,$ for which the $\mzd$-translates of $P\chi_{[0,N]^d}$ satisfy the partition of unity for some $N\in \mn.$ In contrast to the one-dimensional case, these entire functions…
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…
Let f be a dominant rational map of P^k such that there exists s <k, with lambda_s(f)>lambda_l(f) for all l. Under mild hypotheses, we show that, for A outside a pluripolar set of the group of automorphisms of P^k, the map f o A admits a…