Related papers: From the 1-2-3 Conjecture to the Riemann Hypothesi…
We prove that an innocent looking inequality implies the Riemann Hypothesis and show a way to approach this inequality through sums of Legendre symbols.
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…
This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial…
Using derandomization, we provide an upper bound on the compression size of solutions to the graph coloring problem. In general, if solutions to a combinatorial problem exist with high probability and the probability is simple, then there…
The statement of the Riemann hypothesis makes sense for all global fields, not just the rational numbers. For function fields, it has a natural restatement in terms of the associated curve. Weil's work on the Riemann hypothesis for curves…
Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…
The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…