Results 21 to 30 of about 66,960 (267)
Reconstruction of Partitions [PDF]
For the partition $x=[x_1\ge x_2\ge \cdots\ge x_k]$ of the integer $n=\sum_{i}\, x_{i}$ a $t$-deletion is a partition $y=[y_1\ge y_2\ge \cdots\ge y_k]$ with $x_{i}\geq y_{i}\geq 0$ and $\sum_{i}\, (x_{i}-y_{i})=t$. We prove that all partitions of $n$ are reconstructible from their $t$–deletions if $n$ is sufficiently large in relation to $t$.
Pretzel, Oliver, Siemons, Johannes
openaire +3 more sources
A new class of infinite products, and Euler's totient
We introduce some new infinite products, the simplest being(1−y)∏k=2∞∏j∈ϕk(1−ykqj)1/k=(1−y1−qy)1/(1−q),where ϕk is the set of positive integers less than and relatively prime to k, valid for |y|∧|qy| both less than unity, with q≠1.
Geoffrey B. Campbell
doaj +1 more source
Real-world applications of number theory [PDF]
The above abstract has been extracted by the translator from the original article (J. Klaška, Real-world applications of number theory, South Bohemia Mathematical Letters, 25 no.
Rahim Rahmati-Asghar
doaj +1 more source
The genesis of the sports clubs movement in Poland
The formation of the first Polish sports associations is not only an important stage in the development of Polish sport, but is also a crucial element of Polish tradition and culture.
Piotr Kędzia
doaj +1 more source
Ramanujan-type congruences modulo 4 for partitions into distinct parts
In this paper, we consider the partition function Q(n) counting the partitions of n into distinct parts and investigate congruence identities of the form Q(p⋅n+p2-124)≡0 (mod4),Q\left( {p \cdot n + {{{p^2} - 1} \over {24}}} \right) \equiv 0\,\,\,\left(
Merca Mircea
doaj +1 more source
Introduction to logical entropy and its relationship to Shannon entropy
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
Classifiers, partitions, and measurements: Exploring the syntax and semantics of sortal classifiers
In many languages, measure terms like item and kilo, as in two items of furniture and two kilos of rice, can be used either to partition the nominal denotation into countable units, or to measure a denotation without inducing a partition. These two types
Alan Bale, Jessica Coon, Nicholás Arcos
doaj +2 more sources
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition.
BURDERI, Fabio, RESTIVO, Antonio
openaire +4 more sources
Probes for fault localization in computer networks
Fault localization is a process of isolating faults responsible for the observable malfunctioning of the managed system. This paper reviews some existing approaches of this process and improves one of described techniques - the probing.
Wiesław Traczyk
doaj +1 more source
Probabilistic Partitive Partitioning (PPP)
Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies can be achieved by reducing the input space if a minimal loss of information can be achieved.
openaire +2 more sources

