相关论文: Polynomial configurations in sets of positive uppe…

We make quantitative improvements to recently obtained results on the structure of the image of a large difference set under certain quadratic forms and other homogeneous polynomials. Previous proofs used deep results of Benoist-Quint on…

Given a set $\mathcal{F}$ of graphs, we call a copy of a graph in $\mathcal{F}$ an $\mathcal{F}$-graph. The $\mathcal{F}$-isolation number of a graph $G$, denoted by $\iota(G,\mathcal{F})$, is the size of a smallest set $D$ of vertices of…

Let $q$ be a Pisot or Salem number. Let $f_j(x)$ $(j=1,2,\dots)$ be integer-valued polynomials of degree $\ge2$ with positive leading coefficients, and let $\{a_j (n)\}_{n\ge1}$ $(j=1,2,\dots)$ be sequences of algebraic integers in the…

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty}…

We study hypergraphs which are uniquely determined by their chromatic, independence and matching polynomials. B. Bollob\'as, L. Pebody and O. Riordan (2000) conjectured (BPR-conjecture) that almost all graphs are uniquely determined by…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…

We study the dependence of solutions of equations of the form $a_0 + a_1 z^{\ell_1} + ... + a_m z^{\ell_m} = 0$, on the exponents $\ell_1, ..., \ell_m$. We apply our results to equations that appear in graph theory, the theory of…

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and…

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Let $f\in \mathbb{R}[x, y, z]$ be a quadratic polynomial that depends on each variable and that does not have the form $g(h(x)+k(y)+l(z))$. Let $A, B, C$ be compact sets in $\mathbb{R}$. Suppose that $\dim_H(A)+\dim_H(B)+\dim_H(C)>2$, then…

Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski…

In this paper we study the density of polynomials in some $L^2(M)$ spaces. Two choices of the measure $M$ and polynomials are considered: 1) a $(N\times N)$ matrix non-negative Borel measure on $\mathbb{R}$ and vector-valued polynomials…

Given $\varepsilon>0$, there exists $f_0$ such that, if $f_0 \le f \le \Delta^2+1$, then for any graph $G$ on $n$ vertices of maximum degree $\Delta$ in which the neighbourhood of every vertex in $G$ spans at most $\Delta^2/f$ edges, (i) an…

Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…

In this work we prove that the set of points at infinity $S_\infty:={\rm Cl}_{{\mathbb R}{\mathbb P}^m}(S)\cap\mathsf{H}_\infty$ of a semialgebraic set $S\subset{\mathbb R}^m$ which is the image of a polynomial map $f:{\mathbb…

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…