English
Related papers

Related papers: On certain classes of rectangular designs

200 papers

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

Combinatorics · Mathematics 2010-02-17 Harold N. Ward

The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group…

Combinatorics · Mathematics 2019-02-13 Hadi Kharaghani , Sho Suda

There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…

Quantum Algebra · Mathematics 2013-11-13 John Harding , Taewon Yang

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Combinatorics · Mathematics 2025-06-30 Jean Cardinal , Vincent Pilaud

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…

Combinatorics · Mathematics 2023-12-20 Guangzhou Chen , Xiaodong Niu , Jiufeng Shi

Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for…

Combinatorics · Mathematics 2021-06-18 Rebecca J. Stones , Raúl M. Falcón , Daniel Kotlar , Trent G. Marbach

To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…

Combinatorics · Mathematics 2009-05-05 A. A. Khanban , M. Mahdian , E. S. Mahmoodian

An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…

Combinatorics · Mathematics 2013-11-22 Anamari Nakic , Mario Osvin Pavcevic

Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…

Rings and Algebras · Mathematics 2024-03-07 Ted Hurley , Barry Hurley

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Combinatorics · Mathematics 2012-04-24 Ferenc Szöllősi

One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…

General Mathematics · Mathematics 2021-04-14 Christopher Thron

We develop a new method for constructing "good" designs for computer experiments. The method derives its power from its basic structure that builds large designs using small designs. We specialize the method for the construction of…

Statistics Theory · Mathematics 2010-10-05 C. Devon Lin , Derek Bingham , Randy R. Sitter , Boxin Tang

Hexagonal circle patterns with constant intersection angles are introduced and studied. It is shown that they are described by discrete integrable systems of Toda type. Conformally symmetric patterns are classified. Circle pattern analogs…

Complex Variables · Mathematics 2007-05-23 Alexander I. Bobenko , Tim Hoffmann

Fractional factorial designs are widely used for designing screening experiments. Nonregular fractional factorial designs can have better properties than regular designs, but their construction is challenging. Current research on the…

Methodology · Statistics 2021-06-02 Lin Wang , Hongquan Xu

New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…

Statistics Theory · Mathematics 2009-09-04 Peter Z. G. Qian , Mingyao Ai , C. F. Jeff Wu

This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…

Number Theory · Mathematics 2009-06-18 Graham Everest , Jonny Griffiths

Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first…

Combinatorics · Mathematics 2026-05-19 Amin Bahmanian , Sho Suda

Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent…

Complex Variables · Mathematics 2012-09-04 Sumit Nagpal , V. Ravichandran

The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…

Statistics Theory · Mathematics 2011-05-16 Runchu Zhang , Frederick K. H. Phoa , Rahul Mukerjee , Hongquan Xu

A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…

Information Theory · Computer Science 2015-03-24 Cunsheng Ding