中文
相关论文

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

200 篇论文

Kaprekar's Routine is an iteration process that, with each iteration, sorts the digits of a number in descending and ascending orders and uses their difference for the next iteration. In this paper, we successfully address the structure of…

数论 · 数学 2021-02-09 Zichen Wang , Wei Lu

Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in…

数论 · 数学 2016-07-20 Béla Bajnok , Samuel Edwards

Let $1\leq m \leq n$ be integers with $m|n$ and $\cat{Alg}_{n,m}$ the class of central simple algebras of degree $n$ and exponent dividing $m$. In this paper, we find new, improved upper bounds for the essential dimension and 2-dimension of…

环与代数 · 数学 2014-02-26 Sanghoon Baek

The abelian Higgs model is the textbook example for the superconducting transition and the Anderson-Higgs mechanism, and has become pivotal in the description of deconfined quantum criticality. We study the abelian Higgs model with $n$…

强关联电子 · 物理学 2019-10-23 Bernhard Ihrig , Nikolai Zerf , Peter Marquard , Igor F. Herbut , Michael M. Scherer

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

组合数学 · 数学 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu

In this note, we consider the problem of counting and verifying abelian border arrays of binary words. We show that the number of valid abelian border arrays of length \(n\) is \(2^{n-1}\). We also show that verifying whether a given array…

数据结构与算法 · 计算机科学 2021-11-02 Mursalin Habib , Md. Salman Shamil , M. Sohel Rahman

The category of linear algebraic groups admits non-surjective epimorphisms. For simple algebraic groups of rank $2$ defined over algebraically closed fields, we show that the minimal dimension of a closed epimorphic subgroup is $3$.

群论 · 数学 2023-06-30 Iulian I. Simion , Donna M. Testerman

The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…

数论 · 数学 2021-08-10 Arindam Biswas , Jyoti Prakash Saha

A difference set is said to have classical parameters if $ (v,k, \lambda) = (\frac{q^d-1}{q-1}, \frac{q^{d-1}-1}{q-1}, \frac{q^{d-2}-1}{q-1}).$ The case $d=3$ corresponds to planar difference sets. We focus here on the family of abelian…

组合数学 · 数学 2007-05-23 Kevin Jennings

Various upper and lower bounds are provided for the (angular) Kronecker constants of sets of integers. Some examples are provided where the bounds are attained. It is proved that 5=16 bounds the angular Kronecker constants of 3-element sets…

泛函分析 · 数学 2011-08-22 L. Thomas Ramsey , Kathryn E. Hare

We find the minimal non-trivial integer variable group determinant for any dihedral group of order less than $3.79\times 10^{47}$. We think of this as the Lind-Lehmer problem for the dihedral group. We give a complete description of the…

数论 · 数学 2018-02-22 Ton Boerkoel , Christopher Pinner

We derive an explicit system of Picard-Fuchs differential equations satisfied by Abelian integrals of monomial forms and majorize its coefficients. A peculiar feature of this construction is that the system admitting such explicit…

动力系统 · 数学 2007-05-23 D. Novikov , S. Yakovenko

We provide lower bounds on the number of subgroups of a group $G$ as a function of the primes and exponents appearing in the prime factorization of $|G|$. Using these bounds, we classify all abelian groups with 22 or fewer subgroups, and…

群论 · 数学 2020-07-09 David A. Nash , Alexander Betz

We consider lattices generated by finite Abelian groups. We prove that such a lattice is strongly eutactic, which means the normalized minimal vectors of the lattice form a spherical 2-design, if and only if the group is of odd order or if…

The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…

动力系统 · 数学 2022-09-28 Douglas D. Novaes

We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our…

群论 · 数学 2012-02-16 Andrei V. Zavarnitsine

In this paper we discuss two general models of random simplicial complexes which we call the lower and the upper models. We show that these models are dual to each other with respect to combinatorial Alexander duality. The behaviour of the…

代数拓扑 · 数学 2022-01-05 Michael Farber , Lewis Mead , Tahl Nowik

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

组合数学 · 数学 2015-06-10 Robert R. Lewis

We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with…

组合数学 · 数学 2018-08-07 Vsevolod F. Lev

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

经典分析与常微分方程 · 数学 2018-01-10 Han Yu