Image de couverture de livre

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ihringer, Ferdinand
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
par: Ihringer, Ferdinand
Publié: (2024)

Asynchronous dynamics of isomorphic Boolean networks
par: Bridoux, Florian, et autres
Publié: (2024)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
par: Asensio, Sara, et autres
Publié: (2024)

Boolean Functions with Small Approximate Spectral Norm
par: Cheung, Tsun-Ming, et autres
Publié: (2024)

Strong modules and asynchronous attractors of Boolean networks
par: Ruet, Paul
Publié: (2026)

On the number of non-degenerate canalizing Boolean functions
par: Kadelka, Claus
Publié: (2025)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
par: Bonte, Sébastien, et autres
Publié: (2025)

Fractional domatic number and minimum degree
par: Chuet, Quentin, et autres
Publié: (2025)

Elimination distance to bounded degree on planar graphs
par: Lindermayr, Alexander, et autres
Publié: (2020)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
par: Bonte, Sébastien, et autres
Publié: (2025)

Coboundary and cosystolic expansion without dependence on dimension or degree
par: Dikstein, Yotam, et autres
Publié: (2023)

Tree decompositions with small width, spread, order and degree
par: Wood, David R.
Publié: (2025)

On expectations and variances in the hard-core model on bounded degree graphs
par: Davies, Ewan, et autres
Publié: (2025)

Complete polyhedral description of chemical graphs of maximum degree at most 3
par: Dusollier, Valentin, et autres
Publié: (2025)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
par: Ai, Jiangdong, et autres
Publié: (2025)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
par: Kelly, Tom, et autres
Publié: (2018)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
par: Botler, Fábio, et autres
Publié: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
par: Bašić, Milan
Publié: (2026)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
par: Dailly, Antoine, et autres
Publié: (2025)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
par: Gutin, Gregory, et autres
Publié: (2024)

Boundary rigidity of finite CAT(0) cube complexes
par: Chalopin, Jérémie, et autres
Publié: (2023)

A note on the distinct distances problem over finite fields
par: Brukhim, Nataly, et autres
Publié: (2025)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
par: Kurapov, Sergey, et autres
Publié: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
par: Kurapov, Sergey, et autres
Publié: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
par: Kurapov, Sergey, et autres
Publié: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
par: Kurapov, Sergey, et autres
Publié: (2024)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
par: Chang, Fan, et autres
Publié: (2025)

Three-dimensional graph products with unbounded stack-number
par: Eppstein, David, et autres
Publié: (2022)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
par: Adekanye, Melvin, et autres
Publié: (2024)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
par: Kurapov, Sergey, et autres
Publié: (2024)

Dividing sums of cycles in the semiring of functional digraphs
par: Bridoux, Florian, et autres
Publié: (2025)

There is no prime functional digraph: Seifert's proof revisited
par: Richard, Adrien
Publié: (2025)

Bounded degree QBF and positional games
par: Oijid, Nacim
Publié: (2024)

A threshold for online balancing of sparse i.i.d. vectors
par: Altschuler, Dylan J., et autres
Publié: (2025)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Stability of Linear Boolean Networks
par: Chandrasekhar, Karthik, et autres
Publié: (2022)

$(Δ-1)$-dicolouring of digraphs
par: Harutyunyan, Ararat, et autres
Publié: (2025)

On Patterns and Languages in 1-11-Representations of Graphs
par: Das, Biswajit, et autres
Publié: (2026)

The 1/3-conjectures for domination in cubic graphs
par: Dorbec, Paul, et autres
Publié: (2024)

Geometrical Penrose Tilings are characterized by their 1-atlas
par: Fernique, Thomas, et autres
Publié: (2022)