Related papers: From the 1-2-3 Conjecture to the Riemann Hypothesi…

We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.

This article presents a clear proof of the Riemann Mapping Theorem via Riemann's method, uncompromised by any appeals to topological intuition.

We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.

Why do natural and interesting sequences often turn out to be log-concave? We give one of many possible explanations, from the viewpoint of "standard conjectures". We illustrate with several examples from combinatorics.

In recent years, there has been some interest in applying ideas and methods taken from Physics in order to approach several challenging mathematical problems, particularly the Riemann Hypothesis. Most of these kind of contributions are…

As starting point, we formulate a corollary to the Quantitative Combinatorial Nullstellensatz. This corollary does not require the consideration of any coefficients of polynomials, only evaluations of polynomial functions. In certain…

An elementary analytic proof of the famous Riemann hypothesis is given. The main "accent" of the proof is a both using of the 2-dimensional double real and complex Laplace integral representations of the Green function $\mid z \mid^{-2}$.

In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…

The rainbow arborescence conjecture posits that if the arcs of a directed graph with $n$ vertices are colored by $n-1$ colors such that each color class forms a spanning arborescence, then there is a spanning arborescence that contains…

Beginning from the resolution of Dirichlet L function, using the inner product formula of infinite-dimensional vectors in the complex space, the author proved the world's baffling problem--Generalized Riemann hypothesis.

We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

In this article we give a survey on open problems and conjectures concerning L^2-invariants. We cover the whole portfolio and not only certain aspects as they are considered in the previous more specialized (and within their scope more…

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…

We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been…

Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…

This paper presents an offering of some of the myriad connections between Combinatorics and Probability, directed in particular toward combinatorialists. The choice of material was dictated by the author's own interests, tastes and…

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…

Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this survey, Hodge theory, Morse theory, the spectral theory of…

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…