Related papers: The Brown-Colbourn conjecture on zeros of reliabil…
It is shown that every polynomial function $P : \mathbb{C}^2\longrightarrow \mathbb{C}$ with irreducible fibres of same a genus is a coordinate. In consequence, there does not exist counterexamples F = (P,Q) to the Jacobian conjecture such…
A conjecture of Colliot-Th\'{e}l\`{e}ne predicts that for a smooth projective variety $X$ over a finite extension $k$ of $\mathbb{Q}_p$ the kernel of the Albanese map $\text{CH}_0(X)^{\text{deg}=0}\to Alb_X(k)$ is the direct sum of a…
In 1994, it was conjectured by Fan and Raspaud that every simple bridgeless cubic graph has three perfect matchings whose intersection is empty. In this paper we answer a question recently proposed by Mkrtchyan and Vardanyan, by giving an…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
Jacobian conjectures (that nonsingular implies a global inverse) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The birational…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
We disprove the characterisation of graphs with equal independence and annihilation number by Larson and Pepper (2011). Series of counterexamples with arbitrary number of vertices, arbitrary number of components, arbitrary large…
This is the fifth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…
In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…
We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…
In 2001, Woodall conjectured that for every pair of integers $s,t \ge 1$, all graphs without a $K_{s,t}$-minor are $(s+t-1)$-choosable. In this note we refute this conjecture in a strong form: We prove that for every choice of constants…
We present two related conjectures, arising in work on i-matchings in random r-regular bipartite graphs. The conjectures themselves are easily stated and involve only basic properties of convergent power series. One formulation involves…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…
We will prove the Brannan conjecture for particular values of the parameter. The basic tool of the study is an integral representation published in a recent work [3].
The Casas-Alvero conjecture states that if $f(X)$ is a monic univariate polynomial of degree $d$ over a characteristic $0$ field $\mathbb{K}$ such that $\gcd(f, f_{i})$ is non-trivial for each $i=1, \dots, d-1$, then $f(X)=(X-\alpha)^d$ for…
The present study was concerned with network failure problems for simple connected undirected graphs. A connected graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each edge has an identical…
It was conjectured that multiplicity of a singularity is bi-Lipschitz invariant. We disprove this conjecture, constructing examples of bi-Lipschitz equivalent complex algebraic singularities with different values of multiplicity.
We show that for every $M,A,n \in \mathbb{N}$ there exists a graph $G$ that does not contain the $(154\times 154)$-grid as a $3$-fat minor and is not $(M,A)$-quasi-isometric to a graph with no $K_n$ minor. This refutes the conjectured…
In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On…