中文
相关论文

相关论文: Critical sets in the elementary abelian 2- and 3- …

200 篇论文

In this paper, we construct two classes of planar polynomial Hamiltonian systems having a center at the origin, and obtain the lower bounds for the number of critical periods for these systems. For polynomial potential systems of degree…

动力系统 · 数学 2020-05-06 Xiuli Cen

The chromatic number of a latin square $L$, denoted $\chi(L)$, is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square satisfies $\chi(L) \leq |L|+2$. If true, this…

组合数学 · 数学 2019-05-17 Luis Goddyn , Kevin Halasz , E. S. Mahmoodian

Finding the maximum size of a Sidon set in $\mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum…

组合数学 · 数学 2026-01-05 Ingo Czerwinski , Alexander Pott

In this paper we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, $g$, and irregular ones with girth 8, where $a$ is the size, $b$ is the number of degree-one…

信息论 · 计算机科学 2017-06-07 Farzane Amirzade , Mohammad-Reza Sadeghi

Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}$, thereby answering a question of Cameron and Erd\H{o}s. In…

组合数学 · 数学 2022-04-29 Nathanaël Hassler , Andrew Treglown

We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order~11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order $n$…

组合数学 · 数学 2009-09-14 Brendan D. McKay , Ian M. Wanless

We study the Sard problem for the endpoint map in some well-known classes of Carnot groups. Our first main result deals with step 2 Carnot groups, where we provide lower bounds (depending only on the algebra of the group) on the codimension…

微分几何 · 数学 2022-03-31 Francesco Boarotto , Luca Nalon , Davide Vittone

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

组合数学 · 数学 2017-01-18 Matthew Kwan , Benny Sudakov

We study the threshold between avoidable and unavoidable repetitions in infinite balanced sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and Vandomme says that the minimal critical exponent of balanced…

We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary…

量子物理 · 物理学 2023-06-29 Hsiang-Ku Lin , Leonid P. Pryadko

Constructive and nonconstructive techniques are employed to enumerate Latin squares and related objects. It is established that there are (i) 2036029552582883134196099 main classes of Latin squares of order 11; (ii)…

组合数学 · 数学 2010-02-08 Alexander Hulpke , Petteri Kaski , Patric R. J. Östergård

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

数论 · 数学 2016-11-10 Laurent Habsieger , Alain Plagne

Difference sets have been studied for more than 80 years. Techniques from algebraic number theory, group theory, finite geometry, and digital communications engineering have been used to establish constructive and nonexistence results. We…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

组合数学 · 数学 2024-05-22 Kassie Archer , Alexander Diaz-Lopez , Darren Glass , Joel Louwsma

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…

组合数学 · 数学 2017-08-22 Nicholas Cavenagh

There exist few examples of negative Latin square type partial difference sets (NLST PDSs) in nonabelian groups. We present a list of 176 inequivalent NLST PDSs in 48 nonisomorphic, nonabelian groups of order 64. These NLST PDSs form 8…

组合数学 · 数学 2022-04-14 Andrew Charles Brady

In this note we give a characterization of elementary abelian 2-groups in terms of their maximal sum-free subsets.

群论 · 数学 2016-11-29 Marius Tărnăuceanu

We present a simple construction of an acute set of size $2^{d-1}+1$ in $\mathbb{R}^d$ for any dimension $d$. That is, we explicitly give $2^{d-1}+1$ points in the $d$-dimensional Euclidean space with the property that any three points form…

度量几何 · 数学 2017-09-22 Balázs Gerencsér , Viktor Harangi

Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this…

组合数学 · 数学 2011-07-08 Farbod Shokrieh

A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that with high probability a uniformly random Latin square of order $n$ has no proper…

组合数学 · 数学 2024-05-08 Michael J. Gill , Adam Mammoliti , Ian M. Wanless