中文
相关论文

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

200 篇论文

We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…

组合数学 · 数学 2010-06-07 Yusuke Watanabe , Kenji Fukumizu

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

数论 · 数学 2015-09-08 Michiel Kosters

We initiate the study of a multivariate graph polynomial $\Phi_G(x,y,z)$ that interpolates between classical counting polynomials for matchings and for cycle structures arising in the Harary--Sachs expansion of the characteristic…

组合数学 · 数学 2026-02-10 Gabriel Coutinho , Paula M. S. Fialho

Let L be any number field or $\mathfrak{p}$-adic field and consider F:=(f_1,...,f_k) where f_i is in L[x_1,...,x_n]\{0} for all i and there are exactly m distinct exponent vectors appearing in f_1,...,f_k. We prove that F has no more than…

数论 · 数学 2007-05-23 J. Maurice Rojas

Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7…

代数几何 · 数学 2007-09-18 Joel Gomez , Andrew Niles , J. Maurice Rojas

This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…

组合数学 · 数学 2025-12-25 Louis H Kauffman

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

数论 · 数学 2021-11-10 Borys Kuca

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

数论 · 数学 2021-11-30 P Vanchinathan , Krithika M

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

组合数学 · 数学 2013-01-04 Terence Tao

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

组合数学 · 数学 2017-01-24 Leyla Işık , Alev Topuzoğlu

Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…

数论 · 数学 2024-11-07 John R. Doyle , Wade Hindes

We show that for a real transcendental meromorphic function f, the differential polynomial f'+f^m with m > 4 has infinitely many non-real zeros. Similar results are obtained for differential polynomials f'f^m-1. We specially investigate the…

复变函数 · 数学 2008-08-08 W. Bergweiler , A. Eremenko , J. Langley

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

数论 · 数学 2017-12-13 Eyal Moses

Let $r, \,m$ be positive integers. Let $x$ be a rational number with $0 \le x <1$. Consider $\Phi_s(x,z) =\displaystyle\sum_{k=0}^{\infty}\frac{z^{k+1}}{{(k+x+1)}^s}$ the $s$-th Lerch function with $s=1, 2, \cdots, r$. When $x=0$, this is a…

数论 · 数学 2023-01-06 Sinnou David , Noriko Hirata-Kohno , Makoto Kawashima

We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…

动力系统 · 数学 2009-11-11 Henk Bruin , Mike Todd

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

组合数学 · 数学 2011-05-05 Sukhada Fadnavis

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

经典分析与常微分方程 · 数学 2016-08-03 Kevin Henriot , Izabella Laba , Malabika Pramanik

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

交换代数 · 数学 2026-03-17 Ton That Quoc Tan

Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…

数论 · 数学 2023-12-04 Sajad Salami

A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph…

组合数学 · 数学 2016-12-13 Vadim E. Levit , Eugen Mandrescu