scientific article; zbMATH DE number 863501
From MaRDI portal
Publication:4871780
Recommendations
Cited in
(34)- Some applications of algebra to combinatorics
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
- The number of k-sums modulo k
- Zero-sum problems and coverings by proper cosets
- An LP-based k-means algorithm for balancing weighted point sets
- Implicit representation conjecture for semi-algebraic graphs
- Zero-patterns of polynomials and Newton polytopes.
- Modal and guarded characterisation theorems over finite transition systems
- Zero-sum problems -- a survey
- On the automatizability of polynomial calculus
- Uncertainty in finite planes
- On the Thue-Vinogradov lemma
- Optimizing positional scoring rules for rank aggregation
- Deterministic extractors for affine sources over large fields
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Counting dope matrices
- scientific article; zbMATH DE number 1574528 (Why is no real title available?)
- On the number of zero-patterns of a sequence of polynomials
- Essential sign change numbers of full sign pattern matrices
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Refined bounds on the number of connected components of sign conditions on a variety
- Broadcast transmission to prioritizing receivers
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 863510 (Why is no real title available?)
- Improved bounds for incidences between points and circles
- An almost optimal algorithm for computing nonnegative rank
- On the extension complexity of polytopes separating subsets of the Boolean cube
- Implicit representation of sparse hereditary families
- Quantifiers closed under partial polymorphisms
- Finite approximation of free groups. I: The F-inverse cover problem
- Maximal line-free sets in \(\mathbb{F}_p^n\)
- Zero-sum problems in finite Abelian groups: a survey
- The maximum edit distance from hereditary graph properties
- An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871780)
