On linear combinatorics. I: Concurrency---an algebraic approach
The subject of this paper is the following Erdős-type Ramsey problem: Consider two sets \(\Phi\) and \(\Psi\) of lines (in the Euclidean plane) which are the images of affine mappings \( x \mapsto ax+b \) \( (a \not= 0) \), and a set \( \Omega(E) \) of composite mappings \(\left\{ \phi\circ\psi \mid (\phi,\psi) \in E \right\} \) or \(\left\{ \phi\circ\psi, \psi\circ\phi \mid (\phi,\psi) \in E \right\} \) (determined by some \( E \subset \Phi\times\Psi \)). The main result reads: If the size of \(\Omega(E)\) is not too large (at most \(Cn\)) compared to the sizes of \(\Phi\) and \(\Psi\) (at least \(n\), and also less than \(Cn\)), and \(E\) (at least \(cn^2\)) then there are relatively large sets \( \Phi^* \subset \Phi \) and \( \Psi^* \subset \Psi \) (i.e., such that \( \left| (\Phi^* \times \Psi^*) \cap E \right| \geq c^*n^2 \) for some \(c^*(C,c)>0\)) which are both either bundles of parallel lines, or bundles of concurrent lines.
- On linear combinatorics. II: Structure theorems via additive number theory
- On the algebraic structure of combinatorial problems
- scientific article; zbMATH DE number 4074455
- A combinatorial bound for linear programming and related problems
- Some combinatorial-algebraic problems from complexity theory
- scientific article; zbMATH DE number 17698
- On combinatorial properties of linear program digraphs
- scientific article; zbMATH DE number 4062568
- Algebraic Theory for True Concurrency
- scientific article; zbMATH DE number 4049086
- A statistical theorem of set addition
- Diameter of sets and measure of sumsets
- Extremal problems in discrete geometry
- Generalized arithmetical progressions and sumsets
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- On the combinatorics of projective mappings
- A combinatorial problem on polynomials and rational functions
- On sum sets and convex functions
- Popular products and continued fractions
- Modular hyperbolas and bilinear forms of Kloosterman sums
- Product set estimates for non-commutative groups
- The Szemerédi-Trotter theorem in the complex plane
- Non-commutative methods in additive combinatorics and number theory
- The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
- scientific article; zbMATH DE number 7674533 (Why is no real title available?)
- On the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implications
- Classification of maps sending lines into translates of a curve
- A structural Szemerédi-Trotter theorem for Cartesian products
- On the structure of pointsets with many collinear triples
- On the structure of extremal point-line arrangements
- Sharp Szemerédi-Trotter constructions from arbitrary number fields
- Structural Szemerédi-Trotter for lattices and their generalizations
- Sharp Szemerédi-Trotter constructions in the plane
- On a paucity result in incidence geometry
- The structure of sets with few sums along a graph
This page was built for publication: On linear combinatorics. I: Concurrency---an algebraic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280269)
