Pages that link to "Item:Q4287678"
From MaRDI portal
The following pages link to Solving a linear equation in a set of integers I (Q4287678):
Displaying 36 items.
- Multiple ergodic averages for three polynomials and applications (Q3533839) (← links)
- Finding finite 𝐵₂-sequences faster (Q4396456) (← links)
- On sets of natural numbers without solution to a noninvariant linear equation (Q4488449) (← links)
- An application of the sum-product phenomenon to sets avoiding several linear equations (Q4576893) (← links)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers (Q4635508) (← links)
- Maximal operators and decoupling for Λ(p) Cantor measures (Q4958515) (← links)
- On the Combinatorics of Placing Balls into Ordered Bins (Q4958964) (← links)
- New results on modular Golomb rulers, optical orthogonal codes and related structures (Q4993970) (← links)
- B_{h}[g] MODULAR SETS FROM B_{h} MODULAR SETS (Q5075076) (← links)
- On Grids in Point-Line Arrangements in the Plane (Q5088982) (← links)
- Difference bases in dihedral groups (Q5124321) (← links)
- Integral norm discretization and related problems (Q5220242) (← links)
- An Upper Bound for Weak $B_k$-Sets (Q5232131) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Problems on Two-Dimensional Synchronization Patterns (Q5322998) (← links)
- Difference bases in cyclic groups (Q5383858) (← links)
- Carries and the arithmetic progression structure of sets (Q5384140) (← links)
- Behrend-type constructions for sets of linear equations (Q5478114) (← links)
- Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$ (Q5857007) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- The length of an <i>s</i>-increasing sequence of <i>r</i>-tuples (Q5886106) (← links)
- Counting configuration-free sets in groups (Q5920085) (← links)
- Parent-identifying codes (Q5947366) (← links)
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) (Q6041804) (← links)
- An Upper Bound on the Size of Sidon Sets (Q6042555) (← links)
- Graphs without gap-vertex-labellings: families and bounds (Q6064864) (← links)
- An asymmetric random Rado theorem for single equations: The 0‐statement (Q6074694) (← links)
- On some properties of sparse sets: a survey (Q6119193) (← links)
- Sum-distinguishing number of sparse hypergraphs (Q6171496) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- Greedy Sidon sets for linear forms (Q6623035) (← links)
- Sidon-Ramsey and \(B_h\)-Ramsey numbers (Q6636822) (← links)
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations (Q6641588) (← links)
- Caps and wickets (Q6658064) (← links)
- On the Constructor-Blocker game (Q6667585) (← links)
