中文
相关论文

相关论文: The Davenport constant of a box

200 篇论文

For a finite group $G$, we denote by ${\sf d}(G)$ and by ${\sf E}(G)$, respectively, the small Davenport constant and the Gao constant of $G$. Let $C_n$ be the cyclic group of order $n$ and let $G_{m,n,s} = C_n \rtimes_s C_m$ be a…

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

组合数学 · 数学 2011-09-15 Pablo Candela , Olof Sisask

We introduce a definition of braided tensor product $\operatorname{M}\overline{\boxtimes}\operatorname{N}$ of von Neumann algebras equipped with an action of a quasi-triangular quantum group $\mathbb{G}$ (this includes the case when…

算子代数 · 数学 2024-12-24 Kenny De Commer , Jacek Krajczok

A space $X$ is $D$ if for every assignment, $U$, of an open neighborhood to each point $x$ in $X$ there is a closed discrete $D$ such that $\bigcup \{U(x) : x \in D\}=X$. The box product, $\square X^\omega$, is $X^\omega$ with topology…

一般拓扑 · 数学 2021-11-23 Hector A. Barriga-Acosta , Paul M. Gartside

Let $G$ be the alternating group $\mbox{Alt}(n)$ on $n$ letters. We prove that for any $\varepsilon > 0$ there exists $N = N(\varepsilon) \in \mathbb{N}$ such that whenever $n \geq N$ and $A$, $B$, $C$, $D$ are normal subsets of $G$ each of…

群论 · 数学 2020-06-16 Martino Garonzi , Attila Maróti

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

计算几何 · 计算机科学 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is…

组合数学 · 数学 2014-03-03 Saeid Alikhani , Emeric Deutsch

The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the…

组合数学 · 数学 2012-07-11 Tomer Kotek , James Preen , Peter Tittmann

A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector $\boldsymbol{X} = (X_1, \ldots, X_d)$ of arbitrary length can be written as a linear…

概率论 · 数学 2022-11-18 Christian Genest , Frédéric Ouimet

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

数论 · 数学 2026-04-21 Xuancheng Shao

The polyboundedness number $\mathrm{cov}(\mathcal A_X)$ of a semigroup $X$ is the smallest cardinality of a cover of $X$ by sets of the form $\{x\in X:a_0xa_1\cdots xa_n=b\}$ for some $n\ge 1$, $b\in X$ and $a_0,\dots,a_n\in…

群论 · 数学 2022-12-06 Taras Banakh , Andriy Rega

Let $F(X) = \sum_{n \geq 0} (-1)^{\varepsilon_n} X^{-\lambda_n}$ be a real lacunary formal power series, where $\varepsilon_n = 0, 1$ and $\lambda_{n+1}/\lambda_n > 2$. It is known that the denominators $Q_n(X)$ of the convergents of its…

数论 · 数学 2014-04-29 Jean-Paul Allouche , Michel Mendès France

Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…

数论 · 数学 2007-05-23 I. D. Shkredov

Let $G$ be a finite group and $G'$ its commutator subgroup. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered…

交换代数 · 数学 2019-05-06 Jun Seok Oh

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

群论 · 数学 2018-11-28 Andrea Lucchini , Gareth Tracey

The classical Cauchy--Davenport inequality gives a lower bound for the size of the sum of two subsets of ${\mathbb Z}_p$, where $p$ is a prime. Our main aim in this paper is to prove a considerable strengthening of this inequality, where we…

组合数学 · 数学 2022-06-22 Bela Bollobas , Imre Leader , Marius Tiba

Let $N$ be a nilpotent matrix and consider vector fields $\dot\bx=N\bx+\bv(\bx)$ in normal form. Then $\bv$ is equivariant under the flow $e^{N^*t}$ for the inner product normal form or $e^{Mt}$ for the $\ssl_2$ normal form. These vector…

动力系统 · 数学 2015-11-16 James Murdock

Dave Benson conjectured in 2020 that if $G$ is a finite $2$-group and $V$ is an odd-dimensional indecomposable representation of $G$ over an algebraically closed field $\Bbbk$ of characteristic $2$, then the only odd-dimensional…

表示论 · 数学 2023-03-16 George Cao , Kent B. Vashaw

We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…

数论 · 数学 2022-06-22 Simon L. Rydin Myerson