相关论文: Extended Formulations for Independence Polytopes o…

We fix a gap in the proof of a result in our earlier paper arXiv:1908.09548

In this supplementary appendix we provide additional results, omitted proofs and extensive simulations that complement the analysis of the main text (arXiv:1201.0224).

Our published paper contains an incorrect statement of a result due to Artin and Zhang. This corrigendum gives the correct statement of their result and includes a new result that allows us to use their result to prove our main theorem.…

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

The proof given in the paper was incomplete due to an omission in the proof of Lemma 2. A corrected and improved version of the paper is in arXiv:0902.2486.

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Withdrawn due to an incompleteness of the main results.

We make a few comments on some misleading statements in the above paper.

One of the simplest axiomatizations of a matroid is in terms of independent sets. Curiously, no such independent set axiomatization is known for Gelfand and Serganova's WP-matroids (which are ``Coxeter group analogues'' of matroids). Here…

This text is an appendix to our work "On the growth of Kronecker coefficients", arXiv:1607.02887. Here, we provide some complementary theorems, remarks, and calculations that for the sake of space are not going to appear into the final…

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the…

We provide a correction to the sufficient conditions under which closed-form expressions for the optimal Lagrange multiplier are provided in arXiv:2112.13138 [math.OC]. We first present a simple counterexample where the original conditions…

We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the…

Upon presenting the proof of Theorem 3.3 in "Maximal chains in $$ and ultrapowers of the integers" I discovered that it is not entirely correct and certainly some details should be added. I have therefore written an addendum to the paper…

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

In this note, we point out an error in the proof of Theorem 4.7 of [P. Achar and A.~Henderson, `Orbit closures in the enhanced nilpotent cone', Adv. Math. 219 (2008), 27-62], a statement about the existence of affine pavings for fibres of a…

This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.

The purpose of this note is to correct an inaccuracy in the paper: R.P. Agaev and P.Yu. Chebotarev, "On Determining the Eigenprojection and Components of a Matrix," Autom. Remote Control, 2002, vol. 63, pp. 1537-1545 [arXiv:math/0508197],…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

This version corrects a number of mistakes that appeared in the previous draft. In particular, the (EU-LREM) condition is sufficient for existence and uniqueness but not necessary, as we had claimed. We are grateful to P. C. B. Phillips and…