Counting patterns in colored orthogonal arrays

DOI10.1016/J.DISC.2013.11.002zbMATH Open1279.05028arXiv1104.0190OpenAlexW2104187799MaRDI QIDQ393360FDOQ393360

Authors: Amanda Montejano, Oriol Serra 

Publication date: 17 January 2014

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

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.

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

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

zbMATH Keywords

orthogonal arrayscoloringsmonochromatic solutionsSchur triples

Mathematics Subject Classification ID

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

Cites Work

• A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• On monochromatic solutions of equations in groups
• Quantitative theorems for regular systems of equations
• 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\)
• Title not available (Why is that?)
• Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
• Rainbow-free 3-colorings of abelian groups
• Rainbow Arithmetic Progressions and Anti-Ramsey Results
• The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
• Rainbow solutions to the Sidon equation
• On the existence of rainbow 4-term arithmetic progressions

Cited In (3)

• Some Ramsey and anti–Ramsey results in finite groups
• Title not available (Why is that?)
• Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\)

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)