中文
相关论文

相关论文: Largest values of the Stern sequence, alternating …

200 篇论文

We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that…

组合数学 · 数学 2014-01-16 Maciej Gawron

We present a general approach to the problem of determining the asymptotic order of the variance of the optimal score between two independent random sequences defined over an arbitrary finite alphabet. Our general approach is based on…

概率论 · 数学 2012-11-22 Jüri Lember , Heinrich Matzinger , Felipe Torres

We consider the problem of decomposing a higher-order tensor with binary entries. Such data problems arise frequently in applications such as neuroimaging, recommendation system, topic modeling, and sensor network localization. We propose a…

机器学习 · 统计学 2020-09-22 Miaoyan Wang , Lexin Li

We revisit the problem of rational search: given an unknown rational number $\alpha = \frac{a}{b} \in (0,1)$ with $b \leq n$, the goal is to identify $\alpha$ using comparison queries of the form ``$\beta \leq \alpha$?''. The problem has…

数据结构与算法 · 计算机科学 2025-12-23 Connor Weyers , N. V. Vinodchandran

We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: $B_{0}(t)=0, B_{1}(t)=1, B_{2n}(t)=tB_{n}(t)$, and $B_{2n+1}(t)=B_{n}(t)+B_{n+1}(t)$. We study also the sequence…

组合数学 · 数学 2011-02-28 Maciej Ulas , Oliwia Ulas

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

概率论 · 数学 2007-05-23 Christian houdré , Trevis J. Litherland

For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$…

数论 · 数学 2013-07-16 Zhi-Hong Sun , Long Li

We introduce the associated Lah numbers. Some recurrence relations and convolution identities are established. An extension of the associated Stirling and Lah numbers to the r-Stirling and r-Lah numbers are also given. For all these…

组合数学 · 数学 2016-11-02 Hacene Belbachir , Imad Eddine Bousbaa

We define and study certain linear orders on chainable continua. Those orders depend on a sequence of chains obtained from definition of chainability and on a fixed non-principal ultrafilter on the set of natural numbers. An alternative…

一般拓扑 · 数学 2026-02-10 Witold Marciszewski , Julia Ścisłowska , Benjamin Vejnar

Suppose $A\subset \mathbb{R}$ of size $k$ has distinct consecutive $r$--differences, that is for $1 \leq i \leq k -r$, the $r$--tuples $$(a_{i+1} - a_i , \ldots , a_{i+r} - a_{i + r -1})$$ are distinct. Then for any finite $B \subset…

数论 · 数学 2018-06-06 Junxian Li , George Shakan

The problem of storing large amounts of information safely for a long period of time has become essential. One of the most promising new data storage mediums are the polymer-based data storage systems, like the DNA-storage system. These…

信息论 · 计算机科学 2025-04-21 Ville Junnila , Tero Laihonen , Tuomo Lehtilä

An order parameter, termed the maximal row correlation, is proposed for classical spin systems. Monte Carlo simulations on various Potts models suggest that this order parameter is applicable to a broad range of spin systems, including…

统计力学 · 物理学 2025-09-18 Yong-Yi Tang , Yin Zhong , Hantao Lu

In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of…

组合数学 · 数学 2021-06-10 Justine Falque , Jean-Christophe Novelli , Jean-Yves Thibon

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

数据结构与算法 · 计算机科学 2026-05-05 Samuel Boardman

In this paper we study a natural generalization of the Stern-Brocot sequences which comes from the introduction of weighted mediants. We focus our attention on the case $k = 3$, in which $(2a + c)/(2b + d)$ and $(a + 2c)/(b + 2d)$ are the…

数论 · 数学 2017-11-07 Dhroova Aiylam , Tanya Khovanova

Alternating sign triangles (ASTs) have recently been introduced by Ayyer, Behrend and the author, and it was proven that there is the same number of ASTs with n rows as there is of nxn alternating sign matrices (ASMs). We prove a conjecture…

组合数学 · 数学 2018-04-11 Ilse Fischer

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

计算机科学中的逻辑 · 计算机科学 2011-02-15 Saeed Asaeedi , Farzad Didehvar

Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed $5$ stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate…

机器学习 · 计算机科学 2014-08-04 Truyen Tran , Dinh Phung , Svetha Venkatesh

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

数论 · 数学 2012-05-07 Boris Adamczewski , Yann Bugeaud

Algebraic statistics for binary random variables is concerned with highly structured algebraic varieties in the space of 2x2x...x2-tensors. We demonstrate the advantages of representing such varieties in the coordinate system of binary…

组合数学 · 数学 2011-09-06 Bernd Sturmfels , Piotr Zwiernik