Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Chebyshev polynomials involved in the Householder's method for square roots
Y Dijoux - arxiv preprint arxiv:2501.04703, 2024 - arxiv.org
The Householder's method is a root-find algorithm which is a natural extension of the
methods of Newton and Halley. The current paper mostly focuses on approximating the …
methods of Newton and Halley. The current paper mostly focuses on approximating the …
New interpretations for noncrossing partitions of classical types
JS Kim - Journal of Combinatorial Theory, Series A, 2011 - Elsevier
We interpret noncrossing partitions of type B and type D in terms of noncrossing partitions of
type A. As an application, we get type-preserving bijections between noncrossing and …
type A. As an application, we get type-preserving bijections between noncrossing and …
[หนังสือ][B] Combinatorial interpretations of generalizations of Catalan numbers and ballot numbers
EA Allen - 2014 - search.proquest.com
The super Catalan numbers T (m, n)=(2m)!(2n)!/2m! n!(m+ n)! are integers which generalize
the Catalan numbers. Since 1874, when Eugene Catalan discovered these numbers, many …
the Catalan numbers. Since 1874, when Eugene Catalan discovered these numbers, many …
Lattices of paths: representation theory and valuations
L Ferrari, E Munarini - arxiv preprint arxiv:0905.3764, 2009 - arxiv.org
arxiv:0905.3764v1 [math.CO] 22 May 2009 Page 1 arxiv:0905.3764v1 [math.CO] 22 May
2009 Lattices of Paths: Representation Theory and Valuations Luca Ferrari∗ Emanuele …
2009 Lattices of Paths: Representation Theory and Valuations Luca Ferrari∗ Emanuele …
On q-Series and Split Lattice Paths
M Goyal - Graphs and combinatorics, 2020 - Springer
In this paper a natural question which arise to study the graphical aspect of split (n+ t)(n+ t)-
color partitions, is answered by introducing a new class of lattice paths, called split lattice …
color partitions, is answered by introducing a new class of lattice paths, called split lattice …
New Bounds and Constructions for Granular Media Coding
A Sharov, RM Roth - IEEE Transactions on Information Theory, 2015 - ieeexplore.ieee.org
Improved lower and upper bounds on the size and the rate of grain-correcting codes are
presented. The lower bound is Gilbert-Varshamov-like combined with a construction by …
presented. The lower bound is Gilbert-Varshamov-like combined with a construction by …
On divisibility of convolutions of central binomial coefficients
MR Sepanski - The Electronic Journal of Combinatorics, 2014 - combinatorics.org
Recently, Z. Sun proved that\[2 (2m+ 1)\binom {2m}{m}\mid\binom {6m}{3m}\binom {3m}{m}\]
for $ m\in\mathbb {Z} _ {> 0} $. In this paper, we consider a generalization of this result by …
for $ m\in\mathbb {Z} _ {> 0} $. In this paper, we consider a generalization of this result by …
[PDF][PDF] Coding for New Applications in Storage Media
A Sharov - 2011 - Citeseer
1 Background Conventional magnetic recording media are composed of basic magnetizable
units called grains which might be random in size and shape. Information is stored on the …
units called grains which might be random in size and shape. Information is stored on the …
[การอ้างอิง][C] Water capacity of Dyck bridges
A Knopfmacher, A Blecher - Applicable Analysis and Discrete Mathematics, 2025