Solving a linear equation in a set of integers I
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the number of solutions of a linear equation over finite sets
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Random strategies are nearly optimal for generalized van der Waerden games
- Maximal sets with no solution to x+y=3z
- Threshold functions and Poisson convergence for systems of equations in random sets
- On the complexity of finding and counting solution-free sets of integers
- Linear equations and sets of integers
- Coloring the cube with rainbow cycles
- Generalized Sidon sets
- Erdős and the integers
- On symmetric intersecting families
- On 2-parent-identifying set systems of block size 4
- Roth's theorem in many variables
- On grids in point-line arrangements in the plane
- Regular Turán numbers of complete bipartite graphs
- Hypergraphs without exponents
- Shape of the asymptotic maximum sum-free sets in integer lattice grids
- Generalized Turán problems for complete bipartite graphs
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
- Fourier dimension and avoidance of linear patterns
- Normal limiting distributions for systems of linear equations in random sets
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
- Sparse hypergraphs: new bounds and constructions
- On generalized perfect difference sets constructed from Sidon sets
- Solving linear equations in a vector space over a finite field
- The complexity of solution-free sets of integers for general linear equations
- On modular \(k\)-free sets
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- On solution-free sets of integers
- Largest cliques in connected supermagic graphs
- Explicit solutions to certain inf max problems from Turán power sum theory
- Constructions of generalized Sidon sets.
- The apparent structure of dense Sidon sets
- Good low degree rank-1 lattice rules of high dimension
- On the chromatic numbers of integer and rational lattices
- On constructions and parameters of symmetric configurations \(v_k\)
- Online containers for hypergraphs, with applications to linear equations
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On Sidon sets and asymptotic bases
- Multiple ergodic averages for three polynomials and applications
- Uniform hypergraphs containing no grids
- scientific article; zbMATH DE number 1303746 (Why is no real title available?)
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Finding finite 𝐵₂-sequences faster
- On sets of natural numbers without solution to a noninvariant linear equation
- An application of the sum-product phenomenon to sets avoiding several linear equations
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- \(k\)-fold Sidon sets
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- A counterexample to sparse removal
- Solving a linear equation in a set of integers II
- Maximal operators and decoupling for \(\Lambda (p)\) Cantor measures
- On the Combinatorics of Placing Balls into Ordered Bins
- New results on modular Golomb rulers, optical orthogonal codes and related structures
- Common and Sidorenko linear equations
- \(B_h[g]\) modular sets from \(B_h\) modular sets
- Solving equations in dense Sidon sets
- On Grids in Point-Line Arrangements in the Plane
- Enumerating solution-free sets in the integers
- Difference bases in dihedral groups
- Integral norm discretization and related problems
- An Upper Bound for Weak B_k-Sets
- Maximising the number of solutions to a linear equation in a set of integers
- Separating hash families: a Johnson-type bound and new constructions
- Problems on Two-Dimensional Synchronization Patterns
- Difference bases in cyclic groups
- Carries and the arithmetic progression structure of sets
- Non-trivial solutions to a linear equation in integers
- Behrend-type constructions for sets of linear equations
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- The regularity method for graphs with few 4‐cycles
- The length of an s-increasing sequence of r-tuples
- Counting configuration-free sets in groups
- Parent-identifying codes
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
- An Upper Bound on the Size of Sidon Sets
- Graphs without gap-vertex-labellings: families and bounds
- An asymmetric random Rado theorem for single equations: The 0‐statement
- On some properties of sparse sets: a survey
- Sum-distinguishing number of sparse hypergraphs
- On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
- Local-vs-global combinatorics
- On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime
- Greedy Sidon sets for linear forms
- Sidon-Ramsey and \(B_h\)-Ramsey numbers
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
- Caps and wickets
- On the Constructor-Blocker game
- B_h-sets of real and complex numbers
- A generalisation of Varnavides's theorem
- \textbf{Q}-independence and the construction of \(B_h\)-sets of integers and lattice points
- The m-th element of a Sidon set
- Separating hash families with large universe
- Uniform sets with few progressions via colourings
- Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
- The structure of Sidon set systems (extended abstract)
- An efficient asymmetric removal lemma and its limitations
- On Rado's boundedness conjecture
- Permutations destroying arithmetic progressions in finite cyclic groups
- On Costas sets and Costas clouds
This page was built for publication: Solving a linear equation in a set of integers I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287678)
