相关论文: Extended Formulations for Independence Polytopes o…
The comment gives principal arguments proving that the claims given in the title of the commented paper and some its conclusions have to be wrong for principal reasons. An example illustrating the arguments is provided via atomistic…
A complete extension theorem for linear codes over a module alphabet and the symmetrized weight composition is proved. It is shown that an extension property with respect to arbitrary weight function does not hold for module alphabets with…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
This is a revised version of Sh:430, section 6.
In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
This paper corrects an error in the authors' earlier work, by proving stronger forms of the basic lemmas
A false application of Proposition 4.10 causes a mistake in the proof of Corollary 4.11
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
The paper is withdrawn. The proof has an error and it requires a different approach.
In this comment we discuss relative strengths and weaknesses of simplex and Dirichlet Dempster-Shafer inference as applied to multi-resolution tests of independence.
This short note is an erratum to arXiv:1306.4304, correcting the proof of one of its main results. It includes some counterexamples regarding infinite-dimensional unipotent groups and affine spaces that may be of independent interest.
The proposition 1 is incomplete. In some of the examples D(a,b) may not obey the triangle inequality. The paper is withdrawn for further elaboration.
In the paper are proved theorems, which amplify the results of my paper "On the difference equation of Poincare type (Part 3)", Max-Plank-Institut fuer Mathematik, Bonn, Preprint Series, 2004, 09, 1-34.
We clarify the notion of effective equivalence and characterize geometrically the effectively equivalent permutation groups. In particular, we present examples showing that the latter do not correspond to affinely equivalent polytopes…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…
Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.
This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].