61 research outputs found
A note on long rainbow arithmetic progressions
Jungi\'{c} et al (2003) defined as the minimal number such that there is a rainbow arithmetic progression of length
in every equinumerous -coloring of for every .
They proved that for every , and conjectured that . We prove
for all that using the
K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem and Wigert's bound on the divisor
function.Comment: 3 page
Further results on discrete unitary invariance
In arXiv:1607.06679, Marcus proved that certain functions of multiple
matrices, when summed over the symmetries of the cube, decompose into functions
of the original matrices. In this note, we generalize the results from the
Marcus paper to a larger class of functions of multiple matrices. We also
answer a problem posed in the Marcus paper.Comment: 7 page
Improved lower bound on generalized Erdos-Ginzburg-Ziv constants
If is a finite Abelian group, define to be the minimal
such that a sequence of elements in always contains a -element
subsequence which sums to zero. Recently Bitz et al. proved that if , then and for . In this note,
we sharpen their general bound by showing that for .Comment: 3 page
Asymptotic bounds on renewal process stopping times
Suppose that i.i.d. random variables are chosen
uniformly from , and let be an increasing
bijection. Define to be the expected value of for each
. Define the random variable be to be minimal so that and let be the expected value of .
We prove that if , then . This generalizes
a result of \'{C}urgus and Jewett (2007) on the case .Comment: 8 page
Constructing sparse Davenport-Schinzel sequences
For any sequence , the extremal function is the maximum
possible length of a -sparse sequence with distinct letters that avoids
. We prove that if is an alternating sequence of length
, then for all and ,
answering a question of Wellman and Pettie [Lower Bounds on Davenport-Schinzel
Sequences via Rectangular Zarankiewicz Matrices, Disc. Math. 341 (2018),
1987--1993] and extending the result of Roselle and Stanton that for any alternation of length [Some properties of
Davenport-Schinzel sequences, Acta Arithmetica 17 (1971), 355--362].
Wellman and Pettie also asked how large must be for there to exist
-block sequences of length . We answer
this question by showing that the maximum possible length of an -block
sequence is if and only if . We also show related results for extremal functions of
forbidden 0-1 matrices with any constant number of rows and extremal functions
of forbidden sequences with any constant number of distinct letters
Bounds for approximating lower envelopes with polynomials of degree at most
Given a lower envelope in the form of an arbitrary sequence , let denote the maximum length of any subsequence of that can be realized as
the lower envelope of a set of polynomials of degree at most . Let denote the minimum value of over all sequences of length
. We derive bounds on using another extremal function for
sequences.
A sequence is called -free if no subsequence of is isomorphic to
. Given sequences and v, let denote the maximum length of a
-free subsequence of . Let denote the minimum of
over all sequences of length . By bounding for alternating
sequences , we prove quasilinear bounds in on for all .Comment: 9 page
Improved lower bounds on extremal functions of multidimensional permutation matrices
A -dimensional zero-one matrix avoids another -dimensional zero-one
matrix if no submatrix of can be transformed to by changing some
ones to zeroes. Let denote the maximum number of ones in a
-dimensional zero-one matrix that avoids .
Fox proved for sufficiently large that
for almost all permutation matrices . We extend this result by
proving for and sufficiently large that for almost all -dimensional permutation matrices
of dimensions .Comment: 8 page
Metric dimension and pattern avoidance in graphs
In this paper, we prove a number of results about pattern avoidance in graphs
with bounded metric dimension or edge metric dimension. We show that the
maximum possible number of edges in a graph of diameter and edge metric
dimension is at most , sharpening the bound of
from Zubrilina (2018). We also show that the
maximum value of for which some graph of metric dimension contains
the complete graph as a subgraph is . We prove that the
maximum value of for which some graph of metric dimension contains
the complete bipartite graph as a subgraph is .
Furthermore, we show that the maximum value of for which some graph of edge
metric dimension contains as a subgraph is . We
also show that the maximum value of for which some graph of metric
dimension contains as a subgraph is .
In addition, we prove that the -dimensional grids have edge metric dimension at most . This generalizes two results
of Kelenc et al. (2016), that non-path grids have edge metric dimension and
that -dimensional hypercubes have edge metric dimension at most . We also
provide a characterization of -vertex graphs with edge metric dimension
, answering a question of Zubrilina. As a result of this characterization,
we prove that any connected -vertex graph such that has
diameter at most . More generally, we prove that any connected -vertex
graph with edge metric dimension has diameter at most
Improved bounds on maximum sets of letters in sequences with forbidden alternations
Let be the maximum number of distinct letters in any sequence
which can be partitioned into contiguous blocks of pairwise distinct
letters, has at least occurrences of every letter, and has no subsequence
forming an alternation of length . Nivasch (2010) proved that for all fixed . We show that
for all , , and for all fixed .Comment: 10 page
Bounding extremal functions of forbidden matrices using -formations
First, we prove tight bounds of on the extremal function of the forbidden pair of ordered
sequences and using bounds on a class
of sequences called -formations. Then, we show how an analogous method
can be used to derive similar bounds on the extremal functions of forbidden
pairs of matrices consisting of horizontal concatenations of identical
identity matrices and their horizontal reflections.Comment: 10 page
- β¦