Searcharxiv⌕ Search

arXiv subjects

Yifan Jing

Publications and source records attributed to Yifan Jing.

At least 37 records · Page 2Linked to original sources
arXiv2023

Measure doubling of small sets in $\mathrm{SO}(3,\mathbb{R})$

Let $\mathrm{SO}(3,\mathbb{R})$ be the 3D-rotation group equipped with the real-manifold topology and the normalized Haar measure $μ$. Resolving a problem by Breuillard and Green, we show that if $A \subseteq \mathrm{SO}(3,\mathbb{R})$ is an open subset with sufficiently small measure, then $$ μ(A^2) > 3.99 μ(A).$$ We also show a more general result for the product of two sets, which can be seen as a Brunn-Minkowski-type inequality for sets with small measure in $\mathrm{SO}(3,\mathbb{R})$.

math.GR↗
arXiv2023

Integer colorings with forbidden rainbow sums

For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erdős-Rothchild problem in the context of sum-free sets, which asks for the subsets of $[n]$ with the maximum number of rainbow sum-free $r$-colorings. We show that for $r=3$, the interval $[n]$ is optimal, while for $r\geq8$, the set $[\lfloor n/2 \rfloor, n]$ is optimal. We also prove a stability theorem for $r\geq4$. The proofs rely on the hypergraph container method, and some ad-hoc stability analysis.

math.CO↗
arXiv2023

Measure growth in compact semisimple Lie groups and the Kemperman Inverse Problem

Suppose $G$ is a compact semisimple Lie group, $μ$ is the normalized Haar measure on $G$, and $A, A^2 \subseteq G$ are measurable. We show that $$μ(A^2)\geq \min\{1, 2μ(A)+ημ(A)(1-2μ(A))\}$$ with the absolute constant $η>0$ (independent from the choice of $G$) quantitatively determined. We also show a more general result for connected compact groups without a toric quotient and resolve the Kemperman Inverse Problem from 1964.

math.GR↗
arXiv2022

Semialgebraic methods and generalized sum-product phenomena

For a bivariate $P(x,y) \in \mathbb{R}[x,y]\setminus (\mathbb{R}[x] \cup \mathbb{R}[y])$, our first result shows that for all finite $A \subseteq \mathbb{R}$, $|P(A,A)|\geq α|A|^{5/4}$ with $α=α(\mathrm{deg} P) \in \mathbb{R}^{>0}$ unless $$ P(x,y)=f(γu(x)+δu(y)) \text{ or } P(x,y)=f(u^m(x)u^n(y)) $$ for some univariate $f, u \in \mathbb{R}[t]\setminus \mathbb{R}$, constants $γ, δ\in \mathbb{R}^{\neq 0}$, and $m, n\in \mathbb{N}^{\geq 1}$. This resolves the symmetric nonexpanders classification problem proposed by de Zeeuw. Our second and third results are sum-product type theorems for two polynomials, generalizing the classical result by Erdos and Szemerédi as well as a theorem by Shen. We also obtained similar results for $\mathbb{C}$, and from this deduce results for fields of characteristic $0$ and fields of large prime characteristic. The proofs of our results use tools from semialgebraic/o-minimal geometry.

math.LO↗
arXiv2021

On the small measure expansion phenomenon in connected noncompact nonabelian groups

Suppose $G$ is a connected noncompact locally compact group, $A,B$ are nonempty and compact subsets of $G$, $μ$ is a left Haar measure on $G$. Assuming that $G$ is unimodular, and $ μ(A^2) < K μ(A) $ with $K>1$ a fixed constant, our first result shows that there is a continuous surjective group homomorphism $χ: G\to L$ with compact kernel, where $L$ is a Lie group with $$\dim(L) \leq \lfloor\log K\rfloor(\lfloor\log K\rfloor+1)/2.$$ We also demonstrate that this dimension bound is sharp, establish the relationship between $A$ and its image under the quotient map, and obtain a more general version of this result for the product set $AB$ without assuming unimodularity. Our second result classifies $G,A,B$ where $A,B$ have nearly minimal expansions (when $G$ is unimodular, this just means $μ(AB)$ is close to $μ(A)+μ(B)$). This answers a question suggested by Griesmer and Tao, and completes the last open case of the inverse Kemperman problem. The proofs of both results involve a new analysis of locally compact group $G$ with bounded $n-h$, where $n-h$ is an invariant of $G$ appearing in the recently developed nonabelian Brunn-Minkowski inequality. We also generalize Ruzsa's distance and related results to possibly nonunimodular locally compact groups.

math.GR↗
arXiv2021

Minimal and nearly minimal measure expansions in connected unimodular groups

Let $G$ be a connected unimodular group equipped with a (left and hence right) Haar measure $μ_G$, and suppose $A, B \subseteq G$ are nonempty and compact. An inequality by Kemperman gives us $μ_G(AB)\geq\min\{μ_G(A)+μ_G(B),μ_G(G)\}.$ Our first result determines the conditions for the equality to hold, providing a complete answer to a question asked by Kemperman in 1964. Our second result characterizes compact and connected $G$, $A$, and $B$ that nearly realize equality, with quantitative bounds having the sharp exponent. This can be seen up-to-constant as a $(3k-4)$-theorem for this setting and confirms the connected case of conjectures by Griesmer and by Tao. As an application, we get a measure expansion gap result for connected compact simple Lie groups. The tools developed in our proof include an analysis of the shape of minimally and nearly minimally expanding pairs of sets, a bridge from this to the properties of a certain pseudometric, and a construction of appropriate continuous group homomorphisms to either $\mathbb{R}$ or $\mathbb{T} = \mathbb{R}/\mathbb{Z}$ from the pseudometric.

math.CO↗
arXiv2021

The largest $(k, \ell)$-sum-free subsets

Let $\mathscr{M}_{(2,1)}(N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a constant $c=c(2,1)$ and a function $ω(N)\to\infty$ as $N\to\infty$, such that $cN+ω(N)<\mathscr{M}_{(2,1)}(N)<(c+o(1))N$. The constant $c(2,1)$ is determined by Eberhard, Green, and Manners, while the existence of $ω(N)$ is still wide open. In this paper, we study the analogous conjecture on $(k,\ell)$-sum-free sets and restricted $(k,\ell)$-sum-free sets. We determine the constant $c(k,\ell)$ for every $(k,\ell)$-sum-free sets, and confirm the conjecture for infinitely many $(k,\ell)$.

math.CO↗
arXiv2020

Color isomorphic even cycles and a related Ramsey problem

In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a proper edge-coloring of the complete graph $K_{n}$ with $c$ colors containing no $k$ vertex-disjoint color-isomorphic copies of $H$. Using algebraic properties of polynomials over finite fields, we give an explicit proper edge-coloring of $K_{n}$ and show that $f_{k}(n, C_{4})=Θ(n)$ when $k\geqslant 3$ and $n\rightarrow\infty$. The methods we used in the edge-coloring may be of some independent interest. We also consider a related generalized Ramsey problem. For given graphs $G$ and $H,$ let $r(G,H,q)$ be the minimum number of edge-colors (not necessarily proper) of $G$, such that the edges of every copy of $H\subseteq G$ together receive at least $q$ distinct colors. Establishing the relation to the Turán number of specified bipartite graphs, we obtain some general lower bounds for $r(K_{n,n},K_{s,t},q)$ with a broad range of $q$.

math.CO↗
arXiv2020

Defective DP-colorings of sparse simple graphs

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i,j)$-defective DP-colorings of simple graphs. Let $g_{DP}(i,j,n)$ be the minimum number of edges in an $n$-vertex DP-$(i,j)$-critical graph. In this paper we determine sharp bound on $g_{DP}(i,j,n)$ for each $i\geq3$ and $j\geq 2i+1$ for infinitely many $n$.

math.CO↗
arXiv2020

The genus of complete 3-uniform hypergraphs

In 1968, Ringel and Youngs confirmed the last open case of the Heawood Conjecture by determining the genus of every complete graph $K_n$. In this paper, we investigate the minimum genus embeddings of the complete $3$-uniform hypergraphs $K_n^3$. Embeddings of a hypergraph $H$ are defined as the embeddings of its associated Levi graph $L_H$ with vertex set $V(H)\sqcup E(H)$, in which $v\in V(H)$ and $e\in E(H)$ are adjacent if and only if $v$ and $e$ are incident in $H$. We determine both the orientable and the non-orientable genus of $K_n^3$ when $n$ is even. Moreover, it is shown that the number of non-isomorphic minimum genus embeddings of $K_n^3$ is at least $2^{\frac{1}{4}n^2\log n(1-o(1))}$. The construction in the proof may be of independent interest as a design-type problem.

math.CO↗
arXiv2020

The genus of a random bipartite graph

Archdeacon and Grable (1995) proved that the genus of the random graph $G\in\mathcal{G}_{n,p}$ is almost surely close to $pn^2/12$ if $p=p(n)\geq3(\ln n)^2n^{-1/2}$. In this paper we prove an analogous result for random bipartite graphs in $\mathcal{G}_{n_1,n_2,p}$. If $n_1\ge n_2 \gg 1$, phase transitions occur for every positive integer $i$ when $p=Θ((n_1n_2)^{-\frac{i}{2i+1}})$. A different behaviour is exhibited when one of the bipartite parts has constant size, $n_1\gg1$ and $n_2$ is a constant. In that case, phase transitions occur when $p=Θ(n_1^{-1/2})$ and when $p=Θ(n_1^{-1/3})$.

math.CO↗
arXiv2020

On the discrepancies of graphs

In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of certain types, among others spanning trees, Hamiltonian cycles. As usual, we seek for bounds on the sum of the labels that hold for all elements of $\mathcal{S}_G$, for every labeling.

math.CO↗
arXiv2019

Defective DP-colorings of sparse multigraphs

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i,j)$-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider $f_{DP}(i,j,n)$ --- the minimum number of edges that may have an $n$-vertex $(i,j)$-critical multigraph, that is, a multigraph $G$ that has no $(i,j)$-defective DP-coloring but whose every proper subgraph has such a coloring. For every $i$ and $j$, we find linear lower bounds on $f_{DP}(i,j,n)$ that are exact for infinitely many $n$.

math.CO↗
arXiv2019

Expanding Polynomials and Pairs of Polynomials in Characteristic 0

We begin a generalized study of sum-product type phenomenon in different fields by considering pairs $P(x,y)$ and $Q(x,y)$ of two variable polynomials that simultaneously exhibit small symmetric expansion. Our first result is that such $P(x,y)$ and $Q(x,y)$ over $\mathbb{R}$ and $\mathbb{C}$ have very similar structure, obtained by employing semi-algebraic geometry/o-minimality. Then using model-theoretic transfer and basic Galois theory we deduce results for fields of characteristic $0$ and characteristic $p$ when $p$ is large. We obtain as corollaries a generalization of Elekes-Rónyai type structural results to arbitrary characteristic 0 fields, and a strengthening of these classic results in a symmetric case of natural interest. We note a related bound of $5/4$ in the exponent for the sum-product problem in finite fields of large characteristic, although a lower bound for this characteristic cannot be computed from our methods.

math.CO↗
arXiv2019

On vertex-induced weighted Turán problems

Recently, Bennett et al. introduced the vertex-induced weighted Turán problem. In this paper, we consider their open Turán problem under sum-edge-weight function and characterize the extremal structure of $K_{l}$-free graphs. Based on these results, we propose a generalized version of the Erdős-Stone theorem for weighted graphs under two types of vertex-induced weight functions.

math.CO↗
arXiv2019

Counting maximal near perfect matchings in quasirandom and dense graphs

A maximal $\varepsilon$-near perfect matching is a maximal matching which covers at least $(1-\varepsilon)|V(G)|$ vertices. In this paper, we study the number of maximal near perfect matchings in generalized quasirandom and dense graphs. We provide tight lower and upper bounds on the number of $\varepsilon$-near perfect matchings in generalized quasirandom graphs. Moreover, based on these results, we provide a deterministic polynomial time algorithm that for a given dense graph $G$ of order $n$ and a real number $\varepsilon>0$, returns either a conclusion that $G$ has no $\varepsilon$-near perfect matching, or a positive non-trivial number $\ell$ such that the number of maximal $\varepsilon$-near perfect matchings in $G$ is at least $n^{\ell n}$. Our algorithm uses algorithmic version of Szemerédi Regularity Lemma, and has $O(f(\varepsilon)n^{5/2})$ time complexity. Here $f(\cdot)$ is an explicit function depending only on $\varepsilon$.

math.CO↗
arXiv2019

Non-bipartite distance-regular graphs with a small smallest eigenvalue

In 2017, Qiao and Koolen showed that for any fixed integer $D\geq 3$, there are only finitely many such graphs with $θ_{\min}\leq -αk$, where $0<α<1$ is any fixed number. In this paper, we will study non-bipartite distance-regular graphs with relatively small $θ_{\min}$ compared with $k$. In particular, we will show that if $θ_{\min}$ is relatively close to $-k$, then the odd girth $g$ must be large. Also we will classify the non-bipartite distance-regular graphs with $θ_{\min} \leq \frac{D-1}{D}$ for $D =4,5$.

math.CO↗