English
Related papers

Related papers: The lonely runner conjecture holds for nine runner…

200 papers

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…

Probability · Mathematics 2019-05-21 Paul Jung , Greg Markowsky

Predicting the future performance of young runners is an important research issue in experimental sports science and performance analysis. We analyse a data set with annual seasonal best performances of male middle distance runners for a…

Applications · Statistics 2022-06-28 Mattia Stival , Mauro Bernardi , Manuela Cattelan , Petros Dellaportas

Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.

Geometric Topology · Mathematics 2021-03-25 Robert E. Tuzun , Adam S. Sikora

We prove the Farrell-Jones conjecture for free-by-cyclic groups. The proof uses recently developed geometric methods for establishing the Farrell-Jones Conjecture.

Geometric Topology · Mathematics 2021-05-31 Mladen Bestvina , Koji Fujiwara , Derrick Wigglesworth

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

Probability · Mathematics 2008-12-17 Endre Csáki , Antónia Földes , Pál Révész

We show that the Coleman-Oort conjecture can be reduced to three particular cases. As an application we extend a result of Lu and Zuo, to the effect that for g at least 8 the Coleman-Oort conjecture is true on the hyperelliptic locus.

Algebraic Geometry · Mathematics 2022-01-31 Ben Moonen

We settle in the affirmative the Graham-Sloane conjecture.

Combinatorics · Mathematics 2022-01-10 Edinah K. Gnang , Michael Peretzian Williams

A Condorcet voting scheme chooses a winning candidate as one who defeats all others in pairwise majority rule. We provide a review which includes the rigorous mathematical treatment for calculating the limiting probability of a Condorcet…

Statistics Theory · Mathematics 2007-06-13 M. S. Krishnamoorthy , M. Raghavachari

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

General Mathematics · Mathematics 2013-03-14 Carolin Zöbelein

In this paper, we give a simple counter example to the famous Hodge conjecture.

General Mathematics · Mathematics 2013-01-23 Renyi Ma

For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.

Probability · Mathematics 2007-05-23 Jay Rosen

The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…

Rings and Algebras · Mathematics 2012-12-24 Wolfram Bentz , Luis Sequeira

The recent lottery ticket hypothesis proposes that there is one sub-network that matches the accuracy of the original network when trained in isolation. We show that instead each network contains several winning tickets, even if the initial…

Machine Learning · Computer Science 2020-06-15 Kathrin Grosse , Michael Backes

We show that the conclusion of a recent experiment [arXiv:0912.3934] that claims to have discovered that "the speed of light seems to depend on the motion of the observer" is wrong.

General Physics · Physics 2010-02-23 Jerrold Franklin

We combinatorially prove that the number $R(n,k)$ of permutations of length $n$ having $k$ runs is a log-concave sequence in $k$, for all $n$. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Richard Ehrenborg

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

Number Theory · Mathematics 2018-11-14 Vasilii A. Dziubenko , Vladimir A. Letsko

Seymour's distance two conjecture states that in any digraph there exists a vertex (a "Seymour vertex") that has at least as many neighbors at distance two as it does at distance one. We explore the validity of probabilistic statements…

Combinatorics · Mathematics 2015-02-16 Zachary Cohn , Anant Godbole , Elizabeth Wright Harkness , Yiguang Zhang

We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…

Probability · Mathematics 2007-07-06 Endre Csáki , Antónia Földes , Pál Révész

In this paper the circulant Hadamard conjecture is proved.

Combinatorics · Mathematics 2019-09-06 Ronald Orozco López

It is known that the Scholz conjecture on addition chains is true for all integers $n$ with $\ell(2n) = \ell(n)+1$. There exists infinitely many integers with $\ell(2n) \leq \ell(n)$ and we don't know if the conjecture still holds for them.…

Number Theory · Mathematics 2022-10-26 Amadou Tall
‹ Prev 1 3 4 5 6 7 10 Next ›