中文
相关论文

相关论文: On the existence of k-homogeneous Latin bitrades

200 篇论文

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

计算复杂性 · 计算机科学 2009-07-16 Pavel Hrubes , Amir Yehudayoff

For positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

组合数学 · 数学 2019-07-16 Jose G. Mijares

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)$…

组合数学 · 数学 2024-12-18 Afsane Ghafari , Ian M. Wanless

Given an integer partition $P = (h_1h_2\dots h_k)$ of $n$, a realization of $P$ is a latin square with disjoint subsquares of orders $h_1,h_2,\dots,h_k$. Most known results restrict either $k$ or the number of different integers in $P$.…

组合数学 · 数学 2025-10-02 Tara Kemp , James G. Lefevre

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

数论 · 数学 2016-02-16 Zhi-Wei Sun

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

度量几何 · 数学 2022-03-29 Vitaliy Kurlin

A hypergraph is \textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number…

组合数学 · 数学 2026-05-21 Tantan Dai , Alexander Divoux , Tom Kelly

The aim of this work is to determine the quasi-filiform Lie algebras that are completable. We further prove that for any positive integer $m$ there exists a complete Lie algebra, the second cohomology group of which has dimension greater or…

环与代数 · 数学 2009-01-20 L. Garcia-Vergnolle

Let $A$ be a Noetherian standard $\mathbb{N}$-graded algebra over an Artinian local ring $A_0$. Let $I_1,\ldots,I_t$ be homogeneous ideals of $A$ and $M$ a finitely generated $\mathbb{N}$-graded $A$-module. We prove that there exist two…

交换代数 · 数学 2015-09-24 Dipankar Ghosh

We discuss the problem of existence of latin squares without a substructure consisting of six elements $(r_1,c_2,l_3)$, $(r_2,c_3,l_1)$, $(r_3,c_1,l_2)$, $(r_2,c_1,l_3)$, $(r_3,c_2,l_1)$, $(r_1,c_3,l_2)$. Equivalently, the corresponding…

组合数学 · 数学 2026-01-27 Aleksandr D. Krotov , Denis S. Krotov

For all odd positive integers $m$, we construct $\mu$-homogeneous solutions to the thin obstacle problem in $\mathbb{R}^3,$ with $\mu\in(m,m+1)$. For $m$ large, $\mu-m$ converges to $1$, so $\mu\neq m+\tfrac 1 2$. The restriction to odd…

偏微分方程分析 · 数学 2025-04-24 Federico Franceschini , Ovidiu Savin

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

组合数学 · 数学 2016-05-25 Hao Huang , Yi Zhao

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

数论 · 数学 2018-04-05 Kevin Chen , Jianqiang Zhao

Given a partition $h_1+h_2+\dots+h_k = n$, a latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots ,h_k$ is called a realization. When the values $h_i$ are of at most two sizes, the existence of a realization has…

组合数学 · 数学 2026-03-26 Tara Kemp , James G. Lefevre

For any even integer $k\ge 6$, integer $d$ such that $k/2\le d\le k-1$, and sufficiently large $n\in (k/2)\mathbb N$, we find a tight minimum $d$-degree condition that guarantees the existence of a Hamilton $(k/2)$-cycle in every…

组合数学 · 数学 2021-02-22 Hiep Han , Jie Han , Yi Zhao

Two Latin squares $L=[l(i,j)]$ and $M=[m(i,j)]$, of even order $n$ with entries $\{0,1,2,\ldots,n-1\}$, are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields an $n\times n$ array $A=[(l(i,j),m(i,j))]$ in which each…

组合数学 · 数学 2014-01-31 Fatih Demirkale , Diane Donovan , Abdollah Khodkar

We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…

最优化与控制 · 数学 2023-03-23 Daniel Deza , Shmuel Onn

Orthogonality of the Jacobi and of Laguerre polynomials, P_n^(a,b) and L_n^(a), is established for a,b complex (a,b not negative integers and a+b different from -2,-3,...) using the Hadamard finite part of the integral which gives their…

经典分析与常微分方程 · 数学 2009-01-21 Rodica D. Costin

A Latin hypercuboid of order $n$ is a $d$-dimensional matrix of dimensions $n\times n\times\cdots\times n\times k$, with symbols from a set of cardinality $n$ such that each symbol occurs at most once in each axis-parallel line. If $k=n$…

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 =…

组合数学 · 数学 2009-07-13 Ales Drapal , Carlo Hamalainen , Viteslav Kala