Counting patterns in colored orthogonal arrays

DOI10.1016/j.disc.2013.11.002zbMath1279.05028arXiv1104.0190OpenAlexW2104187799MaRDI QIDQ393360

Amanda Montejano, Oriol Serra

Publication date: 17 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.0190

zbMATH Keywords

orthogonal arrayscoloringsmonochromatic solutionsSchur triples

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Unnamed Item ⋮ Some Ramsey and anti–Ramsey results in finite groups

Uses Software

• RON

Cites Work

• Unnamed Item
• Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
• Rainbow-free 3-colorings of abelian groups
• Rainbow solutions to the Sidon equation
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• On the existence of rainbow 4-term arithmetic progressions
• On monochromatic solutions of equations in groups
• Quantitative theorems for regular systems of equations
• A 2-coloring of \([1, N\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less]
• On the number of monochromatic Schur triples.
• On rainbow arithmetic progressions
• The number of monochromatic Schur triples
• Coloured solutions of equations in finite groups
• Density and Ramsey type results on algebraic equations with restricted solution sets
• Rainbow solutions of linear equations over \(\mathbb Z_p\)
• Rainbow Arithmetic Progressions and Anti-Ramsey Results
• The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit

This page was built for publication: Counting patterns in colored orthogonal arrays