中文
相关论文

相关论文: Extremal problems for GCDs

200 篇论文

In this article, we prove that the double inequality $$\alpha G(a,b)+(1-\alpha)C(a,b)<M(a,b)<\beta G(a,b)+(1-\beta)C(a,b)$$ holds true for all $a,b>0$ with $a\neq b$ if and only if $\alpha\geq 5/9$ and $\beta\leq…

经典分析与常微分方程 · 数学 2012-10-16 Tie-Hong Zhao , Yu-Ming Chu , Bo-Yu Liu

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

数论 · 数学 2025-06-18 Jori Merikoski

In this note we prove that for every integer $k$, there exist constants $g_{1}(k)$ and $g_{2}(k)$ such that the following holds. If $G$ is a graph on $n$ vertices with maximum degree $\Delta$ then it contains an induced subgraph $H$ on at…

组合数学 · 数学 2017-05-26 António Girão , Kamil Popielarz

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

动力系统 · 数学 2026-01-21 Ioannis Kousek

For a graph $G$, let $G^2$ be the graph with the same vertex set as $G$ and $xy \in E(G^2)$ when $x \neq y$ and $d_G(x,y) \leq 2$. Bonamy, L\'ev\^{e}que, and Pinlou conjectured that if $mad (G) < 4 - \frac{2}{c+1}$ and $\Delta(G)$ is large,…

组合数学 · 数学 2015-04-15 Matthew Yancey

Foulkes' conjecture has several generalisations due to Doran, Abdesselam--Chipalkatti, Bergeron, and Troyka. For the special linear Lie algebra $\mathfrak{sl}_2(\mathbb{C})$, these assert that given $a \le c \le d \le b$ with $ab=cd$, the…

组合数学 · 数学 2025-08-05 Álvaro Gutiérrez , Michał Szwej

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

This paper studies critical ideals of graphs with twin vertices, which are vertices with the same neighbors. A pair of such vertices are called replicated if they are adjacent, and duplicated, otherwise. Critical ideals of graphs having…

组合数学 · 数学 2017-01-31 Carlos A. Alfaro , Hugo Corrales , Carlos E. Valencia

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

组合数学 · 数学 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.

数论 · 数学 2010-01-15 I. N. Cangül , M. Demirci , G. Soydan , N. Tzanakis

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…

群论 · 数学 2013-11-01 Paul Lescot , Hung Ngoc Nguyen , Yong Yang

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

数据结构与算法 · 计算机科学 2018-01-22 Joergen Bang-Jensen , Stéphane Bessy

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

数论 · 数学 2007-07-16 R Thangadurai

We show that there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x+b^y=c^z$ for positive integers $a$, $b$, and $c$ all greater than one, with just one exceptional case when $\gcd(a,b)=1$, and just one…

数论 · 数学 2024-12-25 Reese Scott , Robert Styer

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

数论 · 数学 2017-04-21 Zhi-Wei Sun

A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to the set $\{0,1,...,k\}$ of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ is a vertex and $y$ is an edge incident…

离散数学 · 计算机科学 2009-11-25 Toru Hasunuma , Toshimasa Ishii , Hirotaka Ono , Yushi Uno

We consider the capability of $p$ groups of class two and odd prime exponent. We use linear algebra and counting arguments to establish a number of new results. In particular, we settle the 4-generator case, and prove a sufficient condition…

群论 · 数学 2007-05-23 Arturo Magidin

We show an analogue of a theorem of An, Ghosh, Guan, and Ly on weighted badly approximable vectors for totally imaginary number fields. We show that for $G=\mathrm{SL}_2(\mathbb{C})\times\dots\times\mathrm{SL}_2(\mathbb{C})$ and $\Gamma<G$…

动力系统 · 数学 2023-10-31 Gaurav Sawant

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

数论 · 数学 2024-09-20 Ali Alsetri , Xuancheng Shao

Let $X,Y$ be jointly Gaussian vectors, and consider random variables $U,V$ that satisfy the Markov constraint $U-X-Y-V$. We prove an extremal inequality relating the mutual informations between all ${4 \choose 2}$ pairs of random variables…

信息论 · 计算机科学 2014-04-29 Thomas Courtade , Jiantao Jiao