Counting patterns in colored orthogonal arrays

DOI10.1016/J.DISC.2013.11.002MaRDI QIDQ393360zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: Let $S$ be an orthogonal array $OA(d,k)$ and let $c$ be an $r$--coloring of its ground set $X$. We give a combinatorial identity which relates the number of vectors in $S$ with given color patterns under $c$ with the cardinalities of the color classes. Several applications of the identity are considered. Among them, we show that every equitable $r$--coloring of the integer interval $[1,n]$ has at least $1/2(n/r{)}^2+O(n)$ monochromatic Schur triples. We also show that in an orthogonal array $OA(d,d-1)$, the number of monochromatic vectors of each color depends only on the number of vectors which miss that color and the cardinality of the color class.

Recommendations

• Counting colorful tilings of rectangular arrays
• Patterns in colored circular permutations
• Efficient Colored Orthogonal Range Counting
• Counting clusters in a coloring grid
• Repeated patterns in proper colorings
• Coloured permutations containing and avoiding certain patterns
• Minimal overlapping patterns in colored permutations
• Pattern avoidance in coloured permutations
• Counting colored random triangulations
• Periodicity and other structure in a colorful family of Nim-like arrays

Cites work

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

Cited in

(3)

• Some Ramsey and anti–Ramsey results in finite groups
• scientific article; zbMATH DE number 7283881 (Why is no real title available?)
• Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\)

Describes a project that uses

Uses Software

• RON

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393360)