arXiv daily

Combinatorics (math.CO)

Thu, 11 May 2023

Other arXiv digests in this category:Thu, 14 Sep 2023; Wed, 13 Sep 2023; Tue, 12 Sep 2023; Mon, 11 Sep 2023; Fri, 08 Sep 2023; Tue, 05 Sep 2023; Fri, 01 Sep 2023; Thu, 31 Aug 2023; Wed, 30 Aug 2023; Tue, 29 Aug 2023; Mon, 28 Aug 2023; Fri, 25 Aug 2023; Thu, 24 Aug 2023; Wed, 23 Aug 2023; Tue, 22 Aug 2023; Mon, 21 Aug 2023; Fri, 18 Aug 2023; Thu, 17 Aug 2023; Wed, 16 Aug 2023; Tue, 15 Aug 2023; Mon, 14 Aug 2023; Fri, 11 Aug 2023; Thu, 10 Aug 2023; Wed, 09 Aug 2023; Tue, 08 Aug 2023; Mon, 07 Aug 2023; Fri, 04 Aug 2023; Thu, 03 Aug 2023; Wed, 02 Aug 2023; Tue, 01 Aug 2023; Mon, 31 Jul 2023; Fri, 28 Jul 2023; Thu, 27 Jul 2023; Wed, 26 Jul 2023; Tue, 25 Jul 2023; Mon, 24 Jul 2023; Fri, 21 Jul 2023; Thu, 20 Jul 2023; Wed, 19 Jul 2023; Tue, 18 Jul 2023; Mon, 17 Jul 2023; Fri, 14 Jul 2023; Thu, 13 Jul 2023; Wed, 12 Jul 2023; Tue, 11 Jul 2023; Mon, 10 Jul 2023; Fri, 07 Jul 2023; Thu, 06 Jul 2023; Wed, 05 Jul 2023; Tue, 04 Jul 2023; Mon, 03 Jul 2023; Fri, 30 Jun 2023; Thu, 29 Jun 2023; Wed, 28 Jun 2023; Tue, 27 Jun 2023; Mon, 26 Jun 2023; Fri, 23 Jun 2023; Thu, 22 Jun 2023; Wed, 21 Jun 2023; Tue, 20 Jun 2023; Fri, 16 Jun 2023; Thu, 15 Jun 2023; Tue, 13 Jun 2023; Mon, 12 Jun 2023; Fri, 09 Jun 2023; Thu, 08 Jun 2023; Wed, 07 Jun 2023; Tue, 06 Jun 2023; Mon, 05 Jun 2023; Fri, 02 Jun 2023; Thu, 01 Jun 2023; Wed, 31 May 2023; Tue, 30 May 2023; Mon, 29 May 2023; Fri, 26 May 2023; Thu, 25 May 2023; Wed, 24 May 2023; Tue, 23 May 2023; Mon, 22 May 2023; Fri, 19 May 2023; Thu, 18 May 2023; Wed, 17 May 2023; Tue, 16 May 2023; Mon, 15 May 2023; Fri, 12 May 2023; Wed, 10 May 2023; Tue, 09 May 2023; Mon, 08 May 2023; Fri, 05 May 2023; Thu, 04 May 2023; Wed, 03 May 2023; Tue, 02 May 2023; Mon, 01 May 2023; Fri, 28 Apr 2023; Thu, 27 Apr 2023; Wed, 26 Apr 2023; Tue, 25 Apr 2023; Mon, 24 Apr 2023; Fri, 21 Apr 2023; Thu, 20 Apr 2023; Wed, 19 Apr 2023; Tue, 18 Apr 2023; Mon, 17 Apr 2023; Fri, 14 Apr 2023; Thu, 13 Apr 2023; Wed, 12 Apr 2023; Tue, 11 Apr 2023; Mon, 10 Apr 2023
1.The number of the set-valued tableaux is odd

Authors:Taikei Fujii, Takahiko Nobukawa, Tatsushi Shimazaki

Abstract: The set-valued tableaux are combinatorial objects introduced by Buch for expressing the tableaux-sum formula of the stable Grothendieck polynomials. Not much is known about the set-valued tableaux compared to the usual case of the semi-standard tableaux. In this paper, we show the odd property for the number of set-valued tableaux.

2.New constructions for disjoint partial difference families and external partial difference families

Authors:S. Huczynska, L. M. Johnson

Abstract: Recently, new combinatorial structures called disjoint partial difference families (DPDFs) and external partial difference families (EPDFs) were introduced, which simultaneously generalize partial difference sets, disjoint difference families and external difference families, and have applications in information security. So far, all known construction methods have used cyclotomy in finite fields. We present the first non-cyclotomic infinite families of DPDFs which are also EPDFs, in structures other than finite fields (in particular cyclic groups and non-abelian groups). As well as direct constructions, we present an approach to constructing DPDFs/EPDFs using relative difference sets (RDSs); as part of this, we demonstrate how the well-known RDS result of Bose extends to a very natural construction for DPDFs and EPDFs.

3.Exponential Erdős-Szekeres theorem for matrices

Authors:Recep Altar Çiçeksiz, Zhihan Jin, Eero Räty, István Tomon

Abstract: In 1993, Fishburn and Graham established the following qualitative extension of the classical Erd\H{o}s-Szekeres theorem. If $N$ is sufficiently large with respect to $n$, then any $N\times N$ real matrix contains an $n\times n$ submatrix in which every row and every column is monotone. We prove that the smallest such $N$ is at most $2^{n^{4+o(1)}}$, greatly improving the previously best known double-exponential upper bound, and getting close to the best known lower bound $n^{n/2}$. In particular, we prove the following surprising sharp transition in the asymmetric setting. On one hand, every $8n^2\times 2^{n^{4+o(1)}}$ matrix contains an $n\times n$ submatrix, in which every row is mononote. On the other hand, there exist $n^{2}/6\times 2^{2^{n^{1-o(1)}}}$ matrices containing no such submatrix .