Related papers: Bounds for orthogonal arrays with repeated rows

We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…

Let $n>m\geqslant 1$ be integers with $n+m\geqslant 4$ even. We prove the existence of Maass forms with large sup norms on anisotropic ${\rm O}(n,m)$, by combining a counting argument with a new period relation showing that a certain…

Given a real closed field $R$, we identify exactly four proper reducts of $R$ which expand the underlying (unordered) $R$-vector space structure. Towards this theorem we introduce a new notion, of strongly bounded reducts of linearly…

The classical recursive upper bound on hypergraph Ramsey numbers due to Erd\H{o}s and Rado states that for $2 \leq k < s \leq t$, \[ r_k(s,t) \leq 2^{\binom{r_{k-1}(s-1,t-1)}{k-1}}. \] In 2010, Conlon, Fox, and Sudakov introduced the…

Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal arrays. The computational complexity of the terms involved…

For any small positive real $\varepsilon$ and integer $t > \frac{1}{\varepsilon}$, we build a graph with a vertex deletion set of size $t$ to a tree, and twin-width greater than $2^{(1-\varepsilon) t}$. In particular, this shows that the…

Orthogonal polynomials with respect to a weight function defined on a wedge in the plane are studied. A basis of orthogonal polynomials is explicitly constructed for two large class of weight functions and the convergence of Fourier…

With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal array OA$(1536,13,2,7)$, constructed in [D.G.Fon-Der-Flaass. Perfect $2$-Colorings of a Hypercube, Sib. Math. J.…

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

This paper establishes the exact comparison complexity of finding an element repeated $n$ times in a $2n$-element array containing $n+1$ distinct values, under the equality-comparison model with $O(1)$ extra space. We present a simple…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

In this paper, we investigated the boundedness of multilinear fractional strong maximal operator $\mathcal{M}_{\mathcal{R},\alpha}$ associated with rectangles or related to more general basis with multiple weights…

We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…

In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving or extending some previous results.

A covering array $t$-$CA(n,k,g)$, of size $n$, strength $t$, degree $k$, and order $g$, is a $k\times n$ array on $g$ symbols such that every $t\times n$ sub-array contains every $t\times 1$ column on $g$ symbols at least once. Covering…

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be…

A plethora of spaces in Functional Analysis (Braun-Meise-Taylor and Carleman ultradifferentiable and ultraholomorphic classes; Orlicz, Besov, Lipschitz, Lebesque spaces, to cite the main ones) are defined by means of a weighted structure,…

We study a special class of four-point correlation functions of infinitely heavy half-BPS operators in planar N=4 SYM which admit factorization into a product of two octagon form factors. We demonstrate that these functions satisfy a system…

We show that if a weight $w\in C^d_{2t}$ and there is $q >1$ such that $w^{2t}\in A_q^d$, then the $L^2$-norm of the $t$-Haar multiplier of complexity $(m,n)$ associated to $w$ depends on the square root of the $C^d_{2t}$-characteristic of…