The minimal number of circuits in a finite set in R^2k-1

DOI10.1007/BF02760960MaRDI QIDQ1063236zbMATH OpenFDO

Authors Michael Kallay

Publication date 1984

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02760960

zbMATH Keywords

affine dependencecircuit

Mathematics Subject Classification ID

Finite geometry and special incidence structures (51E99) Euclidean geometries (general) and generalizations (51M05) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Review text

A circuit in \({\mathfrak R}^ d\) is an affinely dependent subset \(C\subset {\mathfrak R}^ d\) such that every proper subset of C is affinely independent. It is proved in this paper that if S is a subset of \({\mathfrak R}\) of cardinality n and d is odd, then S contains at least \(r\left( \begin{matrix} q\\ 3\end{matrix} \right)+(k-r)\left( \begin{matrix} q+1\\ 3\end{matrix} \right)\) circuits, where \(d=2k-1\), \(n=qk+r\), and \(0\leq r<k\).

Recommendations

• On Independent Circuits Contained in a Graph
• On consistent families of circuits
• Odd circuits in dense binary matroids
• scientific article; zbMATH DE number 3921378
• Some results on the maximum length of circuits of spread k in the d-cube

Cites work

• scientific article; zbMATH DE number 3696004 (Why is no real title available?)
• scientific article; zbMATH DE number 3241005 (Why is no real title available?)
• Minimum numbers of circuits in affine sets

Cited in

(1)

• On minimal π-circuits of closing contacts for symmetric functions with threshold 2

This page was built for publication: The minimal number of circuits in a finite set in \(R^{2k-1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063236)