中文
相关论文

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

200 篇论文

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

组合数学 · 数学 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

代数几何 · 数学 2007-05-23 Alexey Glutsyuk

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

数论 · 数学 2022-11-15 Chatchai Noytaptim , Clayton Petsche

A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…

组合数学 · 数学 2007-05-23 Karola Meszaros

This paper concentrates on positive definite functions on finite abelian groups, which are central to harmonic analysis and related fields. By leveraging the group structure and employing Fourier analysis, we establish a lower bound for the…

泛函分析 · 数学 2025-03-11 Lixia Wang , Ke Ye

We give a classification, up to Morita equivalence, of 2-blocks of quasi-simple groups with abelian defect groups. As a consequence, we show that Donovan's conjecture holds for elementary abelian 2-groups, and that the entries of the Cartan…

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

组合数学 · 数学 2019-03-21 Christian Elsholtz , Péter Pál Pach

In this paper we give subexponential size hitting sets for bounded depth multilinear arithmetic formulas. Using the known relation between black-box PIT and lower bounds we obtain lower bounds for these models. For depth-3 multilinear…

计算复杂性 · 计算机科学 2014-12-01 Rafael Oliveira , Amir Shpilka , Ben Lee Volk

It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism…

组合数学 · 数学 2023-12-29 James D. Currie , Narad Rampersad

Kazhdan constants of discrete groups are hard to compute and the actual constants are known only for several classes of groups. By solving a semidefinite programming problem by a computer, we obtain a lower bound of the Kazhdan constant of…

群论 · 数学 2017-03-23 Koji Fujiwara , Yuichi Kabaya

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

群论 · 数学 2022-08-19 Daniela Bubboloni , Pablo Spiga , Thomas Weigel

We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any…

计算复杂性 · 计算机科学 2014-05-20 Gábor Braun , Samuel Fiorini , Sebastian Pokutta , David Steurer

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

组合数学 · 数学 2010-06-22 Andrew Berget , Andrew Manion , Molly Maxwell , Aaron Potechin , Victor Reiner

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical…

组合数学 · 数学 2013-11-26 Carlos A. Alfaro , Carlos E. Valencia

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

度量几何 · 数学 2020-02-25 Martin Balko , Attila Pór , Manfred Scheucher , Konrad Swanepoel , Pavel Valtr

We determine the mean number of 2-torsion elements in class groups of cubic orders, when such orders are enumerated by discriminant. Specifically, we prove that when isomorphism classes of totally real (resp., complex) cubic orders are…

数论 · 数学 2024-09-04 Ashvin Swaminathan

We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…

组合数学 · 数学 2014-03-10 Jim Geelen , Peter Nelson

In this paper we prove that if there is a regular Paley type partial difference set in an Abelian group $G$ of order $v$, where $v=p_1^{2k_1}p_2^{2k_2}\cdots p_n^{2k_n}$, $n\ge 2$, $p_1$, $p_2$, $\cdots$, $p_n$ are distinct odd prime…

组合数学 · 数学 2019-01-30 Zeying Wang

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

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

交换代数 · 数学 2019-10-29 Adam Boocher , Derrick Wigglesworth