Results 11 to 20 of about 521,112 (282)
A Topological View of Reed–Solomon Codes
Mathematics, 2021 We studied a particular class of well known error-correcting codes known as Reed–Solomon codes. We constructed RS codes as algebraic-geometric codes from the normal rational curve.
Alberto Besana, Cristina Martínez
doaj +1 more source
Combinatorics of k-shapes and Genocchi numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 In this paper we present a work in progress on a conjectural new combinatorial model for the Genocchi numbers. This new model called irreducible k-shapes has a strong algebraic background in the theory of symmetric functions and leads to seemingly new ...
Florent Hivert, Olivier Mallet
doaj +1 more source
From Symmetric Functions to Partition Identities
Axioms, 2023 In this paper, we show that some classical results from q-analysis and partition theory are specializations of the fundamental relationships between complete and elementary symmetric functions.
Mircea Merca
doaj +1 more source
Counting Shi regions with a fixed separating wall [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Athanasiadis introduced separating walls for a region in the extended Shi arrangement and used them to generalize the Narayana numbers. In this paper, we fix a hyperplane in the extended Shi arrangement for type A and calculate the number of dominant ...
Susanna Fishel +2 more
doaj +1 more source
Recursive formulae for the multiplicative partition function
International Journal of Mathematics and Mathematical Sciences, 1999 For a positive integer n, let f(n) be the number of essentially different ways of writing n as a product of factors greater than 1, where two factorizations of a positive integer are said to be essentially the same if they differ only in the order of the
Jun Kyo Kim, Sang Guen Hahn
doaj +1 more source
Geometry and complexity of O'Hara's algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result.
Matjaž Konvalinka, Igor Pak
doaj +1 more source
A simple proof of Pitman–Yor’s Chinese restaurant process from its stick-breaking representation
Dependence Modeling, 2019 For a long time, the Dirichlet process has been the gold standard discrete random measure in Bayesian nonparametrics. The Pitman-Yor process provides a simple and mathematically tractable generalization, allowing for a very flexible control of the ...
Lawless Caroline, Arbel Julyan
doaj +1 more source
On Macrostates in Complex Multi-Scale Systems
Entropy, 2016 A characteristic feature of complex systems is their deep structure, meaning that the definition of their states and observables depends on the level, or the scale, at which the system is considered.
Harald Atmanspacher
doaj +1 more source
Introduction to logical entropy and its relationship to Shannon entropy
4 open, 2022 We live in the information age. Claude Shannon, as the father of the information age, gave us a theory of communications that quantified an “amount of information,” but, as he pointed out, “no concept of information itself was defined.” Logical entropy ...
Ellerman David
doaj +1 more source
Top Coefficients of the Denumerant [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2 x_2+
Velleda Baldoni +5 more
doaj +1 more source