Related papers: On the DLW Conjectures
We obtain new partial results supporting the spectral set conjecture in dimension 1.
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
We give a new demonstration of Loewner's characterization of polynomials, solving in the positive a conjecture proposed by Laird and McCann in 1984.
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…
The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…
In this paper, taking the question of Zhang and L\"{u} into the background, we present one theorem which will improve and extend some recent results related to the Br\"{u}ck Conjecture.
Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree…
In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…
Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…
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…
We prove two polynomial identities which are particular cases of a conjecture arising in the theory of L-functions of twisted Carlitz modules. This conjecture is stated in earlier papers of the second author.
The Milnor conjecture has been a driving force in the theory of quadratic forms over fields, guiding the development of the theory of cohomological invariants, ushering in the theory of motivic cohomology, and touching on questions ranging…
We study a natural analogue of Collatz's Conjecture for polynomials over $\mathbb{F}_2$.
We prove the Dynamical Bogomolov Conjecture for endomorphisms of P^1\times P^1 defined over a number field. We use the equidistribution theorem for points of small height with respect to an algebraic dynamical system, combined with a…
In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
In this note, we are interested in the Jacobian Conjecture. Following the results of L.M.~Dru$\dot{\rm z}$kowski, we consider some vector fields depending on a certain \'etale polynomial map. From results of semialgebraic geometry with the…
It is conjectured by Godsil that the relative number of controllable graphs compared to the total number of simple graphs on n vertices approaches one as n tends to infinity. We prove that this conjecture is true. More generally, our…
We prove a conjecture by A. Kuznetsov and A. Polishchuk on the existence of some particular full exceptional collections in bounded derived categories of coherent sheaves on Grassmannian varieties.
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…