English
Related papers

Related papers: A Recursive Block Pillar Structure in the Kolakosk…

200 papers

In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

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

Let $P(x):=a_d x^d+\cdots+a_0\in\mathbb{Q}[x]$, $a_d>0$, be a polynomial of degree $d\geq 2$. Let $(x_n)$ be a sequence of integers satisfying \begin{equation*} x_{n+1}=P(x_n)\mbox{for all}\quad n=0,1,2\ldots,\quad\mbox{and} \quad…

Number Theory · Mathematics 2023-12-20 Veekesh Kumar

Suppose we have a Nikishin system of $p$ measures with the $k$th generating measure of the Nikishin system supported on an interval $\Delta_k\subset\er$ with $\Delta_k\cap\Delta_{k+1}=\emptyset$ for all $k$. It is well known that the…

Classical Analysis and ODEs · Mathematics 2023-08-30 Steven Delvaux , Abey López García , Guillermo López Lagomasino

An orientable sequence of order $n$ over an alphabet $\{0,1,\ldots, k{-}1\}$ is a cyclic sequence such that each length-$n$ substring appears at most once \emph{in either direction}. When $k= 2$, efficient algorithms are known to construct…

Discrete Mathematics · Computer Science 2024-07-10 Daniel Gabrić , Joe Sawada

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

We study a binary Thue--Morse-type sequence arising from the base-$3/2$ expansion of integers, an archetypal automatic sequence in a rational base numeration system. Because the sequence is generated by a periodic iteration of morphisms…

Combinatorics · Mathematics 2026-02-26 Julien Cassaigne , Bastiàn Espinoza , Michel Rigo , Manon Stipulanti

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

Combinatorics · Mathematics 2026-03-17 César Bautista-Ramos , Carlos Guillén-Galván , Paulino Gómez-Salgado

We study the triangular array defined by the Graham--Knuth--Patashnik recurrence $T(n,k) = (\alpha n + \beta k + \gamma)\, T(n-1,k)+(\alpha' n + \beta' k + \gamma') \, T(n-1,k-1)$ with initial condition $T(0,k) = \delta_{k0}$ and parameters…

Combinatorics · Mathematics 2021-05-11 Jesús Salas , Alan D. Sokal

Katugampola's 2015 study of generalized fractional differential operators produced triangular arrays of integer coefficients indexed by a fractional order r and by dimensions n and k, but no combinatorial interpretation has been established…

Combinatorics · Mathematics 2026-02-26 Jianru Shen , Udita N. Katugampola

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

Combinatorics · Mathematics 2017-05-24 Julien Leroy , Michel Rigo , Manon Stipulanti

We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…

Representation Theory · Mathematics 2017-08-08 Yury A. Neretin

Hofstadter's G function is recursively defined via $G(0)=0$ and then $G(n)=n-G(G(n-1))$. Following Hofstadter, we vary the number $k$ of nested recursive calls in this equation and obtain a family of functions $(F\_k)$. Here we establish…

Discrete Mathematics · Computer Science 2026-05-25 Pierre Letouzey , Shuo Li , Wolfgang Steiner

In this paper, we consider recurrence sequences $x_n=\xi_1 \alpha_1^n+\xi_2 \alpha_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=\xi_1(4+\sqrt{2})^n+\xi_2(4-\sqrt{2})^n$ satisfies the recurrence…

Logic · Mathematics 2025-10-28 Hajime Kaneko , Bill Mance

The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources…

Information Theory · Computer Science 2023-05-11 Kel Levick , Ilan Shomorony

We introduce 3+1 timelike foliation of the four dimensional Lorentz manifold to derive the 3+1 Sen-Ashtekar-Barbero-Immirzi formalism in case of $SO(2,1)$ rotation gauge group, which is possible due to the existence of the $so(2,1)$ algebra…

General Relativity and Quantum Cosmology · Physics 2019-07-05 Leonid Perlov

Let $A(n,r;3)$ be the total weight of the alternating sign matrices of order $n$ whose sole `1' of the first row is at the $r^{th}$ column and the weight of an individual matrix is $3^k$ if it has $k$ entries equal to -1. Define the…

Mathematical Physics · Physics 2007-05-23 Yu. G. Stroganov

Order statistics of periodic, Gaussian noise with 1/f^{\alpha} power spectrum is investigated. Using simulations and phenomenological arguments, we find three scaling regimes for the average gap d_k=<x_k-x_{k+1}> between the k-th and…

Statistical Mechanics · Physics 2013-05-29 N. R. Moloney , K. Ozogany , Z. Racz

A nucleon resonance with spin-parity $J^P=3/2^-$ and mass about 2.1 GeV is essential to reproduce the photoproduction cross sections for $\Lambda(1520)$ released by the LEPS and CLAS Collaborations. It can be explained as the third nucleon…

Nuclear Theory · Physics 2015-04-27 Jun He

We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…

Combinatorics · Mathematics 2020-06-24 Irène Marcovici , Thomas Stoll , Pierre-Adrien Tahay
‹ Prev 1 4 5 6 7 8 10 Next ›