相关论文: Possible volumes of t-(v, t + 1) Latin trades

Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their constituent blocks. They are of importance in applications…

A (t,s)-rack is a rack structure defined on a module over the ring $\ddot\Lambda=\mathbb{Z}[t^{\pm 1},s]/(s^2-(1-t)s)$. We identify necessary and sufficient conditions for two $(t,s)$-racks to be isomorphic. We define enhancements of the…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Let $T = (T^{\textstyle \ast}, T^{\scriptscriptstyle \triangle})$ be a spherical latin bitrade. With each $a=(a_1,a_2,a_3)\in T^{\textstyle \ast}$ associate a set of linear equations $\eq(T,a)$ of the form $b_1+b_2=b_3$, where $b =…

We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a space of limit objects - so-called…

In this note we introduce the concept of the trade space of a latin square. Computations using Sage and the GAP package Simplicial Homology are presented.

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

For a finite set $V\subset \mathbb{R}^n$, a set $T\subset \mathbb{R}^n$ is called $V$-closed if $t \in T$ and $v\in V$ imply that either $t+v\in T$ or $t-v \in T$. The set $P(V):=\{\sum_{v \in W} v: W \subset V\}$ is clearly $V$-closed and…

Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left((1+o(1))\frac{n}{e^2}\right)^{n}$, and conjectured that…

A multi-latin square of order $n$ and index $k$ is an $n\times n$ array of multisets, each of cardinality $k$, such that each symbol from a fixed set of size $n$ occurs $k$ times in each row and $k$ times in each column. A multi-latin…

Latin squares with a balance property among adjacent pairs of symbols---being "Roman" or "row-complete"---have long been used as uniform crossover designs with the number of treatments, periods and subjects all equal. This has been…

This paper addresses the challenges faced in large-volume trading, where executing substantial orders can result in significant market impact and slippage. To mitigate these effects, this study proposes a volatility-volume-based order…

Following the earlier work on {homogeneous Latin bitrades by Cavenagh, Donovan, and Dr'apal (2003 and 2004) Bean, Bidkhori, Khosravi, and E. S. Mahmoodian (2005) we prove the following results. All k-homogeneous Latin bitrades of volume km…

Given positive integers $v$, $k$, $t$ and $\lambda$ with $v \geq k \geq t$, a packing design PD$_{\lambda}(v,k,t)$ is a pair $(V,\mathcal{B})$, where $V$ is a $v$-set and $\mathcal{B}$ is a collection of $k$-subsets of $V$ such that each…

Trades are important objects in combinatorial design theory that may be realized as certain elements of kernels of inclusion matrices. Total trades were introduced recently by Ghorbani, Kamali and Khosravshahi, who showed that over a field…

An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…

For $n \geq 2$ consider the affine Lie algebra $\widehat{s\ell}(n)$ with simple roots $\{\alpha_i \mid 0 \leq i \leq n-1\}$. Let $V(k\Lambda_0), \, k \in \mathbb{Z}_{\geq 1}$ denote the integrable highest weight $\widehat{s\ell}(n)$-module…

Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…

Let $m \leq n \leq k$. An $m \times n \times k$ 0-1 array is a Latin box if it contains exactly $mn$ ones, and has at most one $1$ in each line. As a special case, Latin boxes in which $m = n = k$ are equivalent to Latin squares. Let…

The full $n$-Latin square is the $n\times n$ array with symbols $1,2,\dots ,n$ in each cell. In this paper we show, as part of a more general result, that any defining set for the full $n$-Latin square has size $n^3(1-o(1))$. The full…