Solving a linear equation in a set of integers I
From MaRDI portal
Publication:4287678
DOI10.4064/aa-65-3-259-282zbMath1042.11525OpenAlexW2117908084MaRDI QIDQ4287678
Publication date: 13 December 1995
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/206579
Other combinatorial number theory (11B75) Linear Diophantine equations (11D04) Other results on the distribution of values or the characterization of arithmetic functions (11N64)
Related Items (78)
The length of an s-increasing sequence of r-tuples ⋮ On the Combinatorics of Placing Balls into Ordered Bins ⋮ On the chromatic numbers of integer and rational lattices ⋮ On constructions and parameters of symmetric configurations \(v_k\) ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ On Sidon sets and asymptotic bases ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Normal limiting distributions for systems of linear equations in random sets ⋮ B_{h}[g MODULAR SETS FROM B_{h} MODULAR SETS] ⋮ Problems on Two-Dimensional Synchronization Patterns ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ On solution-free sets of integers ⋮ An application of the sum-product phenomenon to sets avoiding several linear equations ⋮ Linear equations and sets of integers ⋮ Uniform hypergraphs containing no grids ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ 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 ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ 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 ⋮ Maximal sets with no solution to \(x+y=3z\) ⋮ The apparent structure of dense Sidon sets ⋮ Permutations destroying arithmetic progressions in finite cyclic groups ⋮ Counting numerical semigroups by genus and some cases of a question of Wilf. ⋮ Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice ⋮ Threshold functions and Poisson convergence for systems of equations in random sets ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Coloring the cube with rainbow cycles ⋮ Generalized Sidon sets ⋮ Erdős and the integers ⋮ Multiple ergodic averages for three polynomials and applications ⋮ \(k\)-fold Sidon sets ⋮ On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime ⋮ Difference bases in cyclic groups ⋮ Sparse hypergraphs: new bounds and constructions ⋮ A counterexample to sparse removal ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On generalized perfect difference sets constructed from Sidon sets ⋮ Solving linear equations in a vector space over a finite field ⋮ Largest cliques in connected supermagic graphs ⋮ Explicit solutions to certain inf max problems from Turán power sum theory ⋮ On symmetric intersecting families ⋮ Enumerating solution-free sets in the integers ⋮ Counting configuration-free sets in groups ⋮ On the complexity of finding and counting solution-free sets of integers ⋮ On Costas sets and Costas clouds ⋮ An improved construction of progression-free sets ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Finding finite 𝐵₂-sequences faster ⋮ Constructions of generalized Sidon sets. ⋮ Roth's theorem in many variables ⋮ Parent-identifying codes ⋮ On grids in point-line arrangements in the plane ⋮ Sidon sets in \(\mathbb N^d\) ⋮ Difference bases in dihedral groups ⋮ Good low degree rank-1 lattice rules of high dimension ⋮ Carries and the arithmetic progression structure of sets ⋮ Maximal operators and decoupling for Λ(p) Cantor measures ⋮ Regular Turán numbers of complete bipartite graphs ⋮ Hypergraphs without exponents ⋮ Integral norm discretization and related problems ⋮ On Grids in Point-Line Arrangements in the Plane ⋮ An Upper Bound for Weak $B_k$-Sets ⋮ New results on modular Golomb rulers, optical orthogonal codes and related structures ⋮ Shape of the asymptotic maximum sum-free sets in integer lattice grids ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$ ⋮ On modular \(k\)-free sets ⋮ The regularity method for graphs with few 4‐cycles ⋮ On resolvable Golomb rulers, symmetric configurations and progressive dinner parties ⋮ On Rado's boundedness conjecture ⋮ Fourier dimension and avoidance of linear patterns
This page was built for publication: Solving a linear equation in a set of integers I
