Results 11 to 20 of about 113 (106)
Designs, Codes and Cryptography, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nurdagül Anbar, Wilfried Meidl
openaire +4 more sources
Parity biases in partitions and restricted partitions [PDF]
European Journal of Combinatorics, 2022 19 pages, revised based on referee ...
Koustav Banerjee +4 more
openaire +3 more sources
Discrete Mathematics & Theoretical Computer Science, 2007 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
Information Processing Letters, 2002 This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form $a^n$ mod m. The main contribution of this paper is a correction to the upper bound on the number of
William M. Y. Goh +2 more
openaire +2 more sources
Partitive Determiners, Partitive Pronouns and Partitive Case
, 2021 Although the interest in the concept of partitivity has continuously increased in the last decades and has given rise to considerable advances in research, the fine-grained morpho-syntactic and semantic variation displayed by partitive elements across European languages is far from being well-described, let alone well-understood.
Petra Sleeman, Giuliana Giusti
openaire +4 more sources
Probabilistic Partitive Partitioning (PPP)
CoRR, 2020 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
European Journal of Combinatorics, 2005 The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the algebra depend polynomially on a parameter.
Tom Halverson, Arun Ram
openaire +3 more sources
Multiplicative Partitions [PDF]
The Electronic Journal of Combinatorics, 2013 New formulas for the multiplicative partition function are developed. Besides giving a fast algorithm for generating these partitions, new identities for additive partitions and the Riemann zeta function are also produced.
Marc Chamberland +3 more
openaire +2 more sources
Reconstruction of Partitions [PDF]
The Electronic Journal of Combinatorics, 2005 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