English
Related papers

Related papers: Wide enough Latin rectangles are perfects

200 papers

Regarding neighbor balance, we consider natural generalizations of $D$-complete Latin squares and Vatican squares from the finite to the infinite. We show that if $G$ is an infinite abelian group with $|G|$-many square elements, then it is…

Combinatorics · Mathematics 2018-07-24 Anthony B. Evans , Gage N. Martin , Kaethe Minden , M. A. Ollis

De Bruijn tori, or perfect maps, are two-dimensional periodic arrays of letters from a finite alphabet, where each possible pattern of shape (m,n) appears exactly once in a single period. While the existence of certain de Bruijn tori, such…

Discrete Mathematics · Computer Science 2025-11-26 Peer Stelldinger

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

Combinatorics · Mathematics 2016-09-14 Richard J. Mathar

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…

Combinatorics · Mathematics 2019-12-02 M. A. Ollis

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Number Theory · Mathematics 2017-07-11 Doyon Kim

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

Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy conjectured that every $n\times n$ Latin square has a `cycle-free' partial transversal of size $n-2$. We confirm this conjecture in a strong sense for almost all Latin squares, by showing that as $n…

Combinatorics · Mathematics 2022-04-12 Stephen Gould , Tom Kelly

Latin squares are interesting combinatorial objects with many applications. When working with Latin squares, one is sometimes led to deal with partial Latin squares, a generalization of Latin squares. One of the problems regarding partial…

Combinatorics · Mathematics 2014-03-20 Masood Aryapoor

A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square B_n, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We give a…

Combinatorics · Mathematics 2015-03-17 Trent Gregory Marbach

Given an ordered triple of positive integers $(n,r,b)$, where $1\leq b\leq\binom{n}{r}$, does there exist a matrix of size $r\times n$ with exactly $b$ invertible submatrices of size $r\times r$? Such a matrix is called an $(n,r,b)$-matrix.…

Combinatorics · Mathematics 2025-06-24 Edward S. T. Fan , Tony W. H. Wong

An autotopism of a Latin square is a triple $(\alpha,\beta,\gamma)$ of permutations such that the Latin square is mapped to itself by permuting its rows by $\alpha$, columns by $\beta$, and symbols by $\gamma$. Let $\mathrm{Atp}(n)$ be the…

Combinatorics · Mathematics 2015-09-21 Douglas S. Stones , Petr Vojtěchovský , Ian M. Wanless

Let R be an associative ring with unity and let M be an R-module. We call M (ample) Rad-supplementing if M has a (ample) Rad-supplement in every extension. If M is Rad-supplementing, then every direct summand of M is Rad-supplementing, but…

Rings and Algebras · Mathematics 2016-10-03 Salahattin Özdemir

Let $L$ be an $n\times n$ array whose top left $r\times r$ subarray is filled with $k$ different symbols, each occurring at most once in each row and at most once in each column. We establish necessary and sufficient conditions that ensure…

Combinatorics · Mathematics 2025-09-16 Amin Bahmanian , A. J. W. Hilton

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

Combinatorics · Mathematics 2020-07-29 Matthew Kwan

For an integer partition $h_1 + \dots + h_n = N$, a 2-realization of this partition is a latin square of order $N$ with disjoint subsquares of orders $h_1,\dots,h_n$. The existence of 2-realizations is a partially solved problem posed by…

Combinatorics · Mathematics 2025-01-16 Diane Donovan , Tara Kemp , James Lefevre

Let $2<n<m\leq \omega$. Let $\CA_n$ denote the class of cylindric algebras of dimension $n$ and $\RCA_n$ denote the class of representable $\CA_n$s. We say that $\A\in \RCA_n$ is representable up to $m$ if $\Cm\At\A$ has an $m$-square…

Logic · Mathematics 2020-03-12 Tarek Sayed Ahmed

This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…

General Mathematics · Mathematics 2011-10-03 Konstantine Zelator

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Number Theory · Mathematics 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…

Number Theory · Mathematics 2024-01-31 Andrew N. W. Hone

For a nonzero integer $n$, a set of $m$ distinct nonzero integers $\{a_1,a_2,...,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1 \leq i < j \leq m$, is called a $D(n)$-$m$-tuple. In this paper, we show that there infinitely many…

Number Theory · Mathematics 2019-12-30 Andrej Dujella , Vinko Petričević