English
Related papers

Related papers: Sums, products and dilates on sparse graphs

200 papers

Let $r\geq3$ and $G$ be an $r$-uniform hypergraph with vertex set $\left\{ 1,\ldots,n\right\} $ and edge set $E$. Let \[ \mu\left( G\right) :=\max {\textstyle\sum\limits_{\left\{ i_{1},\ldots,i_{r}\right\} \in E}} x_{i_{1}}\cdots x_{i_{r}},…

Combinatorics · Mathematics 2018-03-15 V. Nikiforov

Let $0\le \alpha \le \beta\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = \alpha$ and $\bar{d}(A+B) = \beta$, where $\underline{d}(A+ B)$ and…

Combinatorics · Mathematics 2022-07-05 Hung Viet Chu

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…

Discrete Mathematics · Computer Science 2009-11-25 Toru Hasunuma , Toshimasa Ishii , Hirotaka Ono , Yushi Uno

Let $ \Gamma \subset \RR^s $ be a lattice, obtained from a module in a totally real algebraic number field. Let $G$ be an axis parallel parallelepiped, and let $|G|$ be a volume of $G$. In this paper we prove that $\limsup_{|G| \to \infty}…

Number Theory · Mathematics 2013-07-09 Mordechay B. Levin

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field…

Number Theory · Mathematics 2018-08-22 Ilya D. Shkredov

Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact subset. In…

Dynamical Systems · Mathematics 2019-08-14 Nattalie Tamam

For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…

Probability · Mathematics 2020-08-24 Sky Cao

In the paper, we focus on embedding clique immersions and subdivisions within sparse expanders, and we derive the following main results: (1) For any $0< \eta< 1/2$, there exists $K>0$ such that for sufficiently large $n$, every…

Combinatorics · Mathematics 2024-11-20 Xia Wang , Donglei Yang , Fan Yang , Haotian Yang

Given a positive integer $k$ and graph $G$, the $\mathbb{Z}_k$-Ramsey number $R(G,\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\sum_{e\in…

Combinatorics · Mathematics 2026-05-22 Emily Heath , Andrew Simmons

Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…

Combinatorics · Mathematics 2015-08-06 Jakub Przybyło

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

Number Theory · Mathematics 2018-10-08 Jagannath Bhanja , Ram Krishna Pandey

Let $G$ and $H$ be graphs, with $|V(H)|\geq |V(G)| $, and $f:V(G)\rightarrow V(H)$ a one to one map of their vertices. Let $dilation(f) = max\{ dist_{H}(f(x),f(y)): xy\in E(G) \}$, where $dist_{H}(v,w)$ is the distance between vertices $v$…

Combinatorics · Mathematics 2014-03-13 Zevi Miller , Dan Pritikin , I. H. Sudborough

Let $d\geq 2$, $A \subset \mathbb{Z}^d$ be finite and not contained in a translate of any hyperplane, and $q \in \mathbb{Z}$ such that $|q| > 1$. We show $$|A+ q \cdot A| \geq (|q|+d+1)|A| - O_{q,d}(1).$$

Number Theory · Mathematics 2014-11-03 Antal Balog , George Shakan

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

Number Theory · Mathematics 2012-09-12 Stéphane Fischler , Michael Nakamaye

A subset $D \subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \in V \setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as…

Discrete Mathematics · Computer Science 2014-10-14 Arijit Bishnu , Kunal Dutta , Arijit Ghosh , Subhabrata Paul

We consider the parametric shortest paths problem in a linearly interpolated graph. Given two positively-weighted directed graphs $G_0=(V,E,\omega_0)$ and $G_1=(V,E,\omega_1),$ the linearly interpolated graph is the family of graphs…

We disprove the sum-product conjecture for real numbers by constructing arbitrarily large $A\subset \mathbb{R}$ (whose elements are algebraic integers in a number field of degree $\asymp \log\lvert A\rvert$) such that \[\max(\lvert…

Number Theory · Mathematics 2026-05-28 Thomas F Bloom , Will Sawin , Carl Schildkraut , Dmitrii Zhelezov

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Combinatorics · Mathematics 2023-10-11 Pallabi Manna , Santanu Mandal , Manideepa Saha

For fixed $s\geq 1$ and $t_{1},t_{2}\in(0,1/2)$ we prove that the inequalities $G^{s}(t_{1}a+(1-t_{1})b,t_{1}b+(1-t_{1})a)A^{1-s}(a,b)>AG(a,b)$ and $G^{s}(t_{2}a+(1-t_{2})b,t_{2}b+(1-t_{2})a)A^{1-s}(a,b)>L(a,b)$ hold for all $a,b>0$ with…

Classical Analysis and ODEs · Mathematics 2012-11-03 Yu-Ming Chu , Ye-Fang Qiu , Miao-Kun Wang , Xiao-Yan Ma

In \cite{reed97}, Reed conjectures that the inequality $\chi (G) \leq \left \lceil \textstyle {1/2} (\omega (G) + \Delta (G) + 1) \right \rceil$ holds for any graph $G$. We prove this holds for a graph $G$ if $\bar{G}$ is disconnected. From…

Combinatorics · Mathematics 2007-05-23 landon rabern