Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices

DOI10.1134/S1064562420030096zbMath1474.60012OpenAlexW3085160152MaRDI QIDQ2243756

Yanyan Li

Publication date: 11 November 2021

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562420030096

zbMATH Keywords

Möbius functionthreshold functionsupermodular functionBernoulli matricescombinatorial flag

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52) Boolean functions (94D10)

Related Items (2)

Singularity of discrete random matrices ⋮ On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron

Cites Work

• Unnamed Item
• Unnamed Item
• On the singularity probability of discrete random matrices
• On subspaces spanned by random selections of \(\pm 1\) vectors
• Singularity of random Bernoulli matrices
• On the singularity probability of random Bernoulli matrices
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• On the number of threshold functions
• On the Probability That a Random ± 1-Matrix Is Singular
• A Lower Bound of the Number of Threshold Functions
• On Complete Sets of Logic Primitives
• Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
• Arrangements of hyperplanes and the number of threshold functions

This page was built for publication: Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices