English
Related papers

Related papers: Row-column factorial designs with strength at leas…

200 papers

We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The…

Discrete Mathematics · Computer Science 2012-10-26 Ankit Pat

Augmented designs are typically used in early-stage breeding programs to compare single replicates of test entries by combining them with replicated check varieties. One or two dimensional incomplete blocking can be incorporated in the…

Methodology · Statistics 2025-11-24 E. R. Williams , H-P. Piepho

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

Combinatorics · Mathematics 2022-08-31 Mohamed Omar

In this paper, the Q-factor expression for periodic arrays over a ground plane is determined in terms of the electric current density within the array's unit cell. The expression accounts for the exact shape of the array element. The…

Classical Physics · Physics 2020-02-19 Andrei Ludvig-Osipov , B. L. G. Jonsson

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…

Combinatorics · Mathematics 2023-06-22 Travis Dillon , Attila Sali

If $x$ is a non-empty string then the repetition $xx$ is called a tandem repeat. Similarly, a tandem in a two dimensional array $X$ is a configuration consisting of a same primitive block $W$ that touch each other with one side or corner.…

Combinatorics · Mathematics 2022-05-06 Sivasankar M , Rama R

The $q$-deformed Araki-Woods von Neumann algebras $\Gamma_q(\mathcal{H}_\mathbb{R}, U_t)^{\prime \prime}$ are factors for all $q\in (-1,1)$ whenever $dim(\mathcal{H}_\mathbb{R})\geq 3$. When $dim(\mathcal{H}_\mathbb{R})=2$ they are factors…

Operator Algebras · Mathematics 2022-12-28 Panchugopal Bikram , Kunal Mukherjee , Éric Ricard , Simeng Wang

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

Formal Languages and Automata Theory · Computer Science 2021-01-18 Ismaël Jecker

A stepped wedge cluster randomized trial is a type of longitudinal cluster design that sequentially switches clusters to intervention over time until all clusters are treated. While the traditional posttest-only parallel design requires…

Applications · Statistics 2021-01-05 Fan Li

Let $ K / k $ be a purely inseparable extension of characteristic $ p> 0 $ and of finite size. We recall that $K/k$ is modular if for every $n \in \mathbb{N}$,$K^{p^n}$ and $k$ are $k\cap K^{p^ n}$-linearly disjoint. A natural…

Commutative Algebra · Mathematics 2017-07-18 Hassane Fliouet

This article contains a proof of the MDS conjecture for $k \leq 2p-2$. That is, that if $S$ is a set of vectors of ${\mathbb F}_q^k$ in which every subset of $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and $k \leq…

Combinatorics · Mathematics 2012-01-31 Simeon Ball , Jan De Beule

Let $r,n>1$ be integers and $q$ be any prime power $q$ such that $r\mid q^n-1$. We say that the extension $\mathbb{F}_{q^n}/\mathbb{F}_q$ possesses the line property for $r$-primitive elements if, for every…

Number Theory · Mathematics 2019-10-23 Stephen D. Cohen , Giorgos Kapetanakis

We say that an abelian variety $A_{/\mathbf Q}$ of dimension $g$ is {\em prosaic} if it is semistable, with good reduction at 2 and its points of order $2$ generate a $2$-extension of ${\mathbf Q}$. For $p \equiv 1 \bmod{8}$, let $M_u$ be…

Number Theory · Mathematics 2025-09-17 Armand Brumer , Kenneth Kramer

For PM functions of height 1, the existence of continuous iterative roots of any order was obtained under the characteristic endpoints condition. This raises an open problem about iterative roots without this condition, called…

Classical Analysis and ODEs · Mathematics 2021-09-28 Xiao Tang , Lin Li

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

In this paper we propose a new methodology to represent the results of the robust ordinal regression approach by means of a family of representative value functions for which, taken two alternatives $a$ and $b$, the following two conditions…

Optimization and Control · Mathematics 2021-07-19 Sally Giuseppe Arcidiacono , Salvatore Corrente , Salvatore Greco

A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…

Combinatorics · Mathematics 2025-05-20 Hiroshi Nozaki , Masanori Sawa

Advancements in additive manufacturing have enabled design and fabrication of materials and structures not previously realizable. In particular, the design space of composite materials and structures has vastly expanded, and the resulting…

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

We show that given $n$ and $k$, for $q$ sufficiently large, there always exists an $[n, k]_q$ MDS code that has a generator matrix $G$ satisfying the following two conditions: (C1) Sparsest: each row of $G$ has Hamming weight $n - k + 1$;…

Information Theory · Computer Science 2013-01-23 Son Hoang Dau , Wentu Song , Zheng Dong , Chau Yuen