EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Bxx Designs and configurations

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 14 of 14

Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.

Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)

The Electronic Journal of Combinatorics [electronic only]

Hall exponents of Boolean matrices

Richard A. Brualdi, Bo Lian Liu (1990)

Czechoslovak Mathematical Journal

Handcuffed Designs.

N.S. Mendelsohn, S.H.Y. Hung (1974)

Aequationes mathematicae

Hereditary circuit spaces

V. W. Bryant, J. E. Dawson, Hazel Perfect (1978)

Compositio Mathematica

Higher SPIN alternating sign matrices.

Behrend, Roger E., Knight, Vincent A. (2007)

The Electronic Journal of Combinatorics [electronic only]

Highly Saturated Packings and Reduced Coverings.

G. Fejes Tóth, G. Kuperberg (1998)

Monatshefte für Mathematik

Homomorphisms of nets of fixed degree, with singular points on the same line

Václav Havel (1976)

Czechoslovak Mathematical Journal

Homotopy types of line arrangements.

Michael Falk (1993)

Inventiones mathematicae

Honeycomb arrays.

Blackburn, Simon R., Panoui, Anastasia, Paterson, Maura B., Stinson, Douglas R. (2010)

The Electronic Journal of Combinatorics [electronic only]

Hrátky s geometrií, čísly a maticemi

Miroslav Fiedler (2010)

Pokroky matematiky, fyziky a astronomie

Hyperbolic and Parabolic Packings.

Zheng-Xu He, O. Schramm (1995)

Discrete & computational geometry

Hyperplane Arrangements with a Lattice of Regions.

A. Björner, P.H. Edelman, G.M. Ziegler (1990)

Discrete & computational geometry

Hyperplane Coverings and Blocking Sets.

Aiden A. Bruen, Joseph Adolphe Thas (1982)

Mathematische Zeitschrift

Hyperplanes in matroids and the axiom of choice

Marianne Morillon (2022)

Commentationes Mathematicae Universitatis Carolinae

We show that in set theory without the axiom of choice ZF, the statement sH: “Every proper closed subset of a finitary matroid is the intersection of hyperplanes including it” implies AC $^{fin}$ , the axiom of choice for (nonempty) finite sets. We also provide an equivalent of the statement AC $^{fin}$ in terms of “graphic” matroids. Several open questions stay open in ZF, for example: does sH imply the axiom of choice?

Currently displaying 1 – 14 of 14

Page 1