English
Related papers

Related papers: New necessary conditions for (negative) Latin squa…

200 papers

We investigate the theoretical performances of the Partial Least Square (PLS) algorithm in a high dimensional context. We provide upper bounds on the risk in prediction for the statistical linear model when considering the PLS estimator.…

Statistics Theory · Mathematics 2024-10-15 Luca Castelli , Irène Gannaz , Clément Marteau

For any positive integers $r$, $s$, $m$, $n$, an $(r,s)$-order $(n,m)$-dimensional rectangular tensor ${\cal A}=(a_{i_1\cdots i_r}^{j_1\cdots j_s}) \in ({\mathbb R}^n)^r\times ({\mathbb R}^m)^s$ is called partially symmetric if it is…

Combinatorics · Mathematics 2018-05-28 Linyuan Lu , Arthur L. B. Yang , James J. Y. Zhao

We construct two families of strongly regular Cayley graphs, or equivalently, partial difference sets, based on elementary abelian groups. The parameters of these two families are generalizations of the Denniston and the dual Denniston…

Combinatorics · Mathematics 2026-02-13 Shuxing Li , James A. Davis , Sophie Huczynska , Laura Johnson , John Polhill

In this paper, we study the set $R_g^{(p)}$ of possible Picard numbers of abelian varieties of dimension $g$ over algebraically closed fields of characteristic $p>0$. We show that many of the results for complex abelian varieties have…

Algebraic Geometry · Mathematics 2018-03-26 Roberto Laface

Let $q$ be a prime power. Let $\lambda>1$ be a divisor of $q-1$, and let $\tau>1$ and $\rho>1$ be divisors of $q+1$. Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $n=\lambda \tau \sigma$…

Information Theory · Computer Science 2025-10-14 Oisin Campion , Fernando Hernando , Gary McGuire

Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together through a linear equation system. Moreover, we assume that some…

Machine Learning · Computer Science 2008-02-08 Xavier Bry

A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length $n$ and minimum distance $n-1$. When such codes of length $p+1$ are included as…

Combinatorics · Mathematics 2019-08-02 Sergey Bereg , Peter Dukes

To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…

Combinatorics · Mathematics 2020-08-18 Cian O'Brien

A skew Hadamard difference set (SHDS) is a difference set that satisfies the skew condition. It is known that if a group G admits a skew hadamard difference set, then G is a p-group with order congruent to 3 modulo 4. We will generalize…

Combinatorics · Mathematics 2014-05-02 Carlos Salazar-Lazaro

This overview focuses on the notion of partial dynamical symmetry (PDS), for which a prescribed symmetry is obeyed by a subset of solvable eigenstates, but is not shared by the Hamiltonian. General algorithms are presented to identify…

Nuclear Theory · Physics 2013-04-16 A. Leviatan

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…

Combinatorics · Mathematics 2024-08-15 Andrew C. Brady

The recent development of more sophisticated spectroscopic methods allows acqui- sition of high dimensional datasets from which valuable information may be extracted using multivariate statistical analyses, such as dimensionality reduction…

Applications · Statistics 2023-11-14 Mario Fordellone , Andrea Bellincontro , Fabio Mencarelli

It is shown that if $F$ denotes the number of filled cells in a superimposed pair of maximal orthogonal partial Latin squares of order $n$, then $F\ge n^2/3$. This resolves a conjecture raised in an earlier paper by the current authors. It…

Combinatorics · Mathematics 2026-02-11 Diane M. Donovan , Mike Grannell , Emine Şule Yazıcı

A partial geometry $S$ admitting an abelian Singer group $G$ is called of rigid type if all lines of $S$ have a trivial stabilizer in $G$. In this paper, we show that if a partial geometry of rigid type has fewer than $1000000$ points it…

Combinatorics · Mathematics 2020-07-29 Stefaan De Winter , Ellen Kamischke , Eric Neubert , Zeying Wang

We prove that, for all even $n\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \big\lfloor n/6 \big\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$…

Combinatorics · Mathematics 2024-12-18 Afsane Ghafari , Ian M. Wanless

Partial least squares (PLS) is a dimensionality reduction technique introduced in the field of chemometrics and successfully employed in many other areas. The PLS components are obtained by maximizing the covariance between linear…

Methodology · Statistics 2023-12-05 David del Val , José R. Berrendero , Alberto Suárez

This is a note on the classical Waring's problem for several homogeneous forms. For positive integers (n,d,r,s), fix a general r-dimensional subspace of degree d forms in n+1 variables. We describe the family of s-sided polar polyhedra of…

Algebraic Geometry · Mathematics 2007-05-23 Jaydeep Chipalkatti

Let $P$ be a partial latin square of prime order $p>7$ consisting of three cyclically generated transversals. Specifically, let $P$ be a partial latin square of the form: \[ P=\{(i,c+i,s+i),(i,c'+i,s'+i),(i,c''+i,s''+i)\mid 0 \leq i< p\} \]…

Combinatorics · Mathematics 2007-12-04 Nicholas J. Cavenagh , Carlo Hamalainen , Adrian M. Nelson

A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. Based on this representation, we apply a uniform method to prove the M. Hall's,…

Combinatorics · Mathematics 2022-08-18 Béla Jónás

We present a reduced basis (RB) method for parametrized linear elliptic partial differential equations (PDEs) in a least-squares finite element framework. A rigorous and reliable error estimate is developed, and is shown to bound the error…

Numerical Analysis · Mathematics 2020-09-24 Jehanzeb Hameed Chaudhry , Luke N. Olson , Peter Sentz
‹ Prev 1 3 4 5 6 7 10 Next ›