English
Related papers

Related papers: The Pell Tower and Ostronometry

200 papers

Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.

General Mathematics · Mathematics 2022-09-14 H. Nelson Crooks , Chigozie Nwoke

We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…

Combinatorics · Mathematics 2025-10-27 Quentin Dubroff , Jeff Kahn , Jinyoung Park

A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…

Combinatorics · Mathematics 2012-05-01 Jonathan Burns , Tilahun Muche

In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.…

Combinatorics · Mathematics 2009-02-03 Laszlo Lovasz

We briefly explore a sequence that came up in recent work of Tirrell and Zhuang. We discover an unusual phenomenon where the sequence appears at first to have periodic behavior but eventually has non-periodic fluctuations.

Combinatorics · Mathematics 2019-07-31 Justin M. Troyka

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

Combinatorics · Mathematics 2016-08-10 Simão Herdade , Van Vu

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…

Combinatorics · Mathematics 2015-12-29 Alexander Lubotzky , Zur Luria , Ron Rosenthal

This paper is a sequel to [3]. We formulate a natural algebraic geometry conjecture, give some of its number theoretic and analytical consequences, and show that those can be used to get further advances in wave turbulence theory.

Number Theory · Mathematics 2024-12-24 Sergei Vlăduţ

Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…

Combinatorics · Mathematics 2023-05-10 Antoine Labelle , Stoyan Dimitrov

We define and study two classes of uncountable $\subseteq^*$-chains: Hausdorff towers and Suslin towers. We discuss their existence in various models of set theory. Then, some of the results and methods are used to provide examples of…

Logic · Mathematics 2014-10-01 Piotr Borodulin-Nadzieja , David Chodounský

We prove that almost every non-regular real quadratic map is Collet-Eckmann and has polynomial recurrence of the critical orbit (proving a conjecture by Sinai). It follows that typical quadratic maps have excellent ergodic properties, as…

Dynamical Systems · Mathematics 2007-05-23 Artur Avila , Carlos Gustavo Moreira

Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…

Probability · Mathematics 2015-06-15 Dan Romik

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

Combinatorics · Mathematics 2007-05-23 David Callan

Let $l$ and $p$ be two distinct prime numbers. We study $l$-isogeny graphs of ordinary elliptic curves defined over a finite field of characteristic $p$, together with a level structure. Firstly, we show that as the level varies over all…

Number Theory · Mathematics 2024-07-12 Antonio Lei , Katharina Müller

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

Combinatorics · Mathematics 2024-09-04 Michael A. Allen , Kenneth Edwards

We give three interpretations of the number $b$ of orbits of the Borel subgroup of upper triangular matrices on the variety $\ms{X}$ of complete quadrics. First, we show that $b$ is equal to the number of standard Young tableaux on…

Combinatorics · Mathematics 2012-06-08 Mahir Bilen Can , Michael Joyce

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

Number Theory · Mathematics 2024-10-17 Deepa Antony , Rupam Barman

For certain typical perturbations $(f_n)_n$ of a rational map $f$ with parabolic cycles, we investigate the relations between the Hausdorff convergence of Julia sets and invariant rays, and the horocyclic convergence of multipliers of…

Dynamical Systems · Mathematics 2026-02-25 Xiaoguang Wang

We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…

Geometric Topology · Mathematics 2024-03-04 Mingkun Liu , Bram Petri

Mixing induction and coinduction, we study alternative definitions of streams being finitely red. We organize our definitions into a hierarchy including also some well-known alternatives in intuitionistic analysis. The hierarchy collapses…

Logic in Computer Science · Computer Science 2015-07-01 Marc Bezem , Keiko Nakata , Tarmo Uustalu
‹ Prev 1 8 9 10 Next ›