English
Related papers

Related papers: On upper bounds of frieze patterns

200 papers

It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a $N\times N$ random unitary matrix sampled from the Haar measure grows like $CN/(\log N)^{3/4}$ for some…

Probability · Mathematics 2016-09-21 Louis-Pierre Arguin , David Belius , Paul Bourgade

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

Combinatorics · Mathematics 2021-06-21 Griffin Johnston , Michael Tait , Craig Timmons

Characterizations of finite sequences $\beta_{1}<\cdots<\beta_{n}$ representing expected values of order statistics from a random sample of size $n$ are given. As a by-product, a characterization of binomial mixtures, when the mixing random…

Probability · Mathematics 2022-05-02 A. Okolewski , N. Papadatos

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

Given two Coxeter's frieze patterns with the same width and consisting of positive numbers, choose a row and consider the periodic sequence of the differences of the respective entries of the two friezes. We ask for which rows this sequence…

Metric Geometry · Mathematics 2018-06-18 Serge Tabachnikov

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

Number Theory · Mathematics 2015-09-01 Michelle Rudolph-Lilith

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

Combinatorics · Mathematics 2014-01-23 Seth Pettie

We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.

Number Theory · Mathematics 2016-05-03 Johann Cigler

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

Combinatorics · Mathematics 2021-10-13 Jie Ma , Tianchi Yang

The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…

Combinatorics · Mathematics 2015-01-19 Michael Albert , Bjarki Gudmundsson , Henning Ulfarsson

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…

Combinatorics · Mathematics 2022-09-20 Marilena Barnabei , Flavio Bonetti , Niccolò Castronuovo , Matteo Silimbani

The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…

Combinatorics · Mathematics 2019-09-17 C. Dalfó , M. A. Fiol

In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…

Number Theory · Mathematics 2024-06-27 Ji-Cai Liu

It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon…

Combinatorics · Mathematics 2012-11-19 Kalle Saari

We consider transport exponents associated with the dynamics of a wavepacket in a discrete one-dimensional quantum system and develop a general method for proving upper bounds for these exponents in terms of the norms of transfer matrices…

Disordered Systems and Neural Networks · Physics 2007-05-23 David Damanik , Serguei Tcheremchantsev

Preferential equality is an equivalence relation on fuzzy subsets of finite sets and is a generalization of classical equality of subsets. In this paper we introduce a tightened version of the preferential equality on fuzzy subsets and…

General Mathematics · Mathematics 2024-06-26 Venkat Murali , Sithembele Nkonkobe

The \textit{order of appearance} $ z(n) $ of a positive integer $ n $ in the Fibonacci sequence is defined as the smallest positive integer $ j $ such that $ n $ divides the $ j $-th Fibonacci number. A \textit{fixed point} arises when, for…

Number Theory · Mathematics 2023-09-27 Molly FitzGibbons , Steven J. Miller , Amanda Verga

Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.

Discrete Mathematics · Computer Science 2007-05-23 Alex Vinokur

We analyse the growth coefficients of infinite frieze patterns arising from cluster algebras using cluster modular groups and cluster categories. For a fixed cluster category of affine type, we prove that the collection of infinite frieze…

Combinatorics · Mathematics 2026-03-24 Karin Baur , Anna Felikson , Deepanshu Prasad , Pavel Tumarkin , Emine Yıldırım

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge