scholarly journals Regular Matroids Have Polynomial Extension Complexity

2021 ◽  
Author(s):  
Manuel Aprile ◽  
Samuel Fiorini
Keyword(s):  
Spanning Tree ◽  
Extended Formulations ◽  
Polynomial Extension ◽  
Regular Matroid ◽  
Extension Complexity ◽  
Special Case

We prove that the extension complexity of the independence polytope of every regular matroid on [Formula: see text] elements is [Formula: see text]. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a [Formula: see text] bound for the special case of (co)graphic matroids. However, the case of a general regular matroid was open, despite recent attempts. We also consider the extension complexity of circuit dominants of regular matroids, for which we give a [Formula: see text] bound.

Kruskal's theorem for matroids

1968 ◽  
Vol 64 (1) ◽  
pp. 3-4 ◽  
Author(s):  
D. J. A. Welsh
Keyword(s):  
Vector Space ◽  
Finite Subset ◽  
Spanning Tree ◽  
General Theorem ◽  
Independent Set ◽  
Easy Method ◽  
Maximal Weight ◽  
Linearly Independent ◽  
Kruskal’S Theorem ◽  
Special Case

AbstractKruskal's theorem for obtaining a minimal (maximal) spanning tree of a graph is shown to be a special case of a more general theorem for matroid spaces in which each element of the matroid has an associated weight. Since any finite subset of a vector space can be regarded as a matroid space this theorem gives an easy method of selecting a linearly independent set of vectors of minimal (maximal) weight.

scholarly journals Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Manuel Aprile ◽  
Samuel Fiorini ◽  
Tony Huynh ◽  
Gwenaël Joret ◽  
David R. Wood
Keyword(s):  
Spanning Tree ◽  
Short Proof ◽  
Induced Subgraphs ◽  
Direct Construction ◽  
Extension Complexity ◽  
Graph Classes ◽  
Closed Class ◽  
Vertex Graph ◽  
Graph Class ◽  
Strongly Sublinear

Let $G$ be a connected $n$-vertex graph in a proper minor-closed class $\mathcal G$. We prove that the extension complexity of the spanning tree polytope of $G$ is $O(n^{3/2})$. This improves on the $O(n^2)$ bounds following from the work of Wong (1980) and Martin (1991). It also extends a result of Fiorini, Huynh, Joret, and Pashkovich (2017), who obtained a $O(n^{3/2})$ bound for graphs embedded in a fixed surface. Our proof works more generally for all graph classes admitting strongly sublinear balanced separators: We prove that for every constant $\beta$ with $0<\beta<1$, if $\mathcal G$ is a graph class closed under induced subgraphs such that all $n$-vertex graphs in $\mathcal G$ have balanced separators of size $O(n^\beta)$, then the extension complexity of the spanning tree polytope of every connected $n$-vertex graph in $\mathcal{G}$ is $O(n^{1+\beta})$. We in fact give two proofs of this result, one is a direct construction of the extended formulation, the other is via communication protocols. Using the latter approach we also give a short proof of the $O(n)$ bound for planar graphs due to Williams (2002).

scholarly journals Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs

2017 ◽  
Vol 57 (3) ◽  
pp. 757-761 ◽  
Author(s):  
Samuel Fiorini ◽  
Tony Huynh ◽  
Gwenaël Joret ◽  
Kanstantsin Pashkovich
Keyword(s):  
Spanning Tree ◽  
Extended Formulations

Extreme self-sacrifice beyond fusion: Moral expansiveness and the special case of allyship

2018 ◽  
Vol 41 ◽  
Author(s):  
Daniel Crimston ◽  
Matthew J. Hornsey
Keyword(s):  
General Theory ◽  
Biological Markers ◽  
Natural Environment ◽  
Relevant Dimension ◽  
Special Case

AbstractAs a general theory of extreme self-sacrifice, Whitehouse's article misses one relevant dimension: people's willingness to fight and die in support of entities not bound by biological markers or ancestral kinship (allyship). We discuss research on moral expansiveness, which highlights individuals’ capacity to self-sacrifice for targets that lie outside traditional in-group markers, including racial out-groups, animals, and the natural environment.

Determination of the phase structure of polymerblends by electron microscopy

1978 ◽  
Vol 36 (1) ◽  
pp. 492-493
Author(s):  
Dr. G. Kaemof
Keyword(s):  
Screw Extruder ◽  
Electron Microscopic ◽  
Thin Sections ◽  
Single Screw Extruder ◽  
Transmission Electron ◽  
The Matrix ◽  
Twin Screw ◽  
Special Case ◽  
Microscopic Investigations

A mixture of polycarbonate (PC) and styrene-acrylonitrile-copolymer (SAN) represents a very good example for the efficiency of electron microscopic investigations concerning the determination of optimum production procedures for high grade product properties.The following parameters have been varied:components of charge (PC : SAN 50 : 50, 60 : 40, 70 : 30), kind of compounding machine (single screw extruder, twin screw extruder, discontinuous kneader), mass-temperature (lowest and highest possible temperature).The transmission electron microscopic investigations (TEM) were carried out on ultra thin sections, the PC-phase of which was selectively etched by triethylamine.The phase transition (matrix to disperse phase) does not occur - as might be expected - at a PC to SAN ratio of 50 : 50, but at a ratio of 65 : 35. Our results show that the matrix is preferably formed by the components with the lower melting viscosity (in this special case SAN), even at concentrations of less than 50 %.

Test Validation Without Measurement

2016 ◽  
Vol 32 (3) ◽  
pp. 204-214 ◽  
Author(s):  
Emilie Lacot ◽  
Mohammad H. Afzali ◽  
Stéphane Vautier
Keyword(s):  
Test Data ◽  
Test Scores ◽  
Scientific Explanation ◽  
Test Validation ◽  
Clinical Tests ◽  
Ethical Perspective ◽  
Power Of Test ◽  
Memory Accuracy ◽  
Social Uses ◽  
Special Case

Abstract. Test validation based on usual statistical analyses is paradoxical, as, from a falsificationist perspective, they do not test that test data are ordinal measurements, and, from the ethical perspective, they do not justify the use of test scores. This paper (i) proposes some basic definitions, where measurement is a special case of scientific explanation; starting from the examples of memory accuracy and suicidality as scored by two widely used clinical tests/questionnaires. Moreover, it shows (ii) how to elicit the logic of the observable test events underlying the test scores, and (iii) how the measurability of the target theoretical quantities – memory accuracy and suicidality – can and should be tested at the respondent scale as opposed to the scale of aggregates of respondents. (iv) Criterion-related validity is revisited to stress that invoking the explanative power of test data should draw attention on counterexamples instead of statistical summarization. (v) Finally, it is argued that the justification of the use of test scores in specific settings should be part of the test validation task, because, as tests specialists, psychologists are responsible for proposing their tests for social uses.

Sign in / Sign up

Export Citation Format

Share Document