English
Related papers

Related papers: Fibonacci numbers and the probability of polygon f…

200 papers

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…

Dynamical Systems · Mathematics 2016-04-19 Huang Yuke , Wen Zhiying

The generalised random Fibonacci chain is a stochastic extension of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 1^i01^{m-i}$ with probability $p_i$, where $p_i\geq 0$ with…

Combinatorics · Mathematics 2012-03-12 Johan Nilsson

Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…

Number Theory · Mathematics 2007-06-13 Michael Filaseta , Angel Kumchev , Dmitrii V. Pasechnik

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

We consider invariant measures of maps on manifolds whose correlations decay at a sufficient rate and which satisfy a geometric contraction property. We then prove the that the limiting distribution of returns to geometric balls is…

Dynamical Systems · Mathematics 2016-02-08 Nicolai Haydn , Fan Yang

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

Combinatorics · Mathematics 2024-10-28 Miklos Bona , Boris Pittel

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

Number Theory · Mathematics 2018-08-09 Kunle Adegoke

It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenth- or seventeenth powers in the Fibonacci sequence. For eleventh, thirteenth- and seventeenth powers an alternative (to the usual exhaustive check of products…

Number Theory · Mathematics 2019-01-07 J. Mc Laughlin

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

Combinatorics · Mathematics 2026-04-16 Giedrius Alkauskas

We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…

Metric Geometry · Mathematics 2018-11-28 Richard Evan Schwartz

Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the…

Combinatorics · Mathematics 2021-05-27 Candice Marshall , Asamoah Nkwanta

We construct irreducible balanced non-transitive sets of $n$-sided dice for any positive integer $n$, which was raised in \cite[Question 5.2]{SS17}. One main tool of the construction is to study so-called fair sets of dice. Furthermore, we…

Probability · Mathematics 2020-11-11 Injo Hur , Yeansu Kim

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

Combinatorics · Mathematics 2012-12-27 Raman Sanyal

There are two methods for counting the number of occurrences of a string in another large string. One is to count the number of places where the string is found. The other is to determine how many pieces of string can be extracted without…

Data Structures and Algorithms · Computer Science 2022-11-09 Ayaka Takamoto , Mitsuo Yoshida , Kyoji Umemura

For a geodesic ball with non-negative Ricci curvature and almost maximal volume, without using compactness argument, we construct an $\epsilon$-splitting map on a concentric geodesic ball with uniformly small radius. There are two new…

Differential Geometry · Mathematics 2023-06-14 Guoyi Xu , Jie Zhou

Let $G$ be a finite graph with minimum degree $r$. Form a random subgraph $G_p$ of $G$ by taking each edge of $G$ into $G_p$ independently and with probability $p$. We prove that for any constant $\epsilon>0$, if $p=\frac{1+\epsilon}{r}$,…

Combinatorics · Mathematics 2013-06-25 Alan Frieze , Michael Krivelevich

The list of properties of Fibonacci numbers F(n) (with multifaceted relevance in physics) is complemented by an empirical observation that in combination with the "next" family of the "delayed Fibonacci" numbers G(n) called, for…

Mathematical Physics · Physics 2016-09-07 Miloslav Znojil

We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…

Number Theory · Mathematics 2014-09-03 Igor Szczyrba , Rafal Szczyrba , Martin Burtscher

Spin, $s$ in quantum theory can assume only half odd integer or integer values. For a given $s$, there exist $n=2s+1$ states $|s,m\rangle$, $m=s,s-1,........,-s$. A statistical assembly of particles (like a beam or target employed in…

Nuclear Theory · Physics 2019-09-10 G. Ramachandran

We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code…

Information Theory · Computer Science 2024-04-22 Giuseppe Cocco , Albert Guillén i Fàbregas , Josep Font-Segura