Results 31 to 40 of about 660,683 (355)
Recursive formulae for the multiplicative partition function
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
Partitive Determiners, Partitive Pronouns and Partitive Case
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
Combinatorics of k-shapes and Genocchi numbers [PDF]
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
Metric spaces of partitions, and Caccioppoli partitions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LEONARDI, Gian Paolo, TAMANINI I.
openaire +4 more sources
On Macrostates in Complex Multi-Scale Systems
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
Counting Shi regions with a fixed separating wall [PDF]
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
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
Line graphs, link partitions, and overlapping communities. [PDF]
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community.
T. Evans, R. Lambiotte
semanticscholar +1 more source
Some remarks on 3-partitions of multisets. [PDF]
Partitions play an important role in numerous combinatorial optimization problems. Here we introduce the number of ordered 3-partitions of a multiset M having equal sums denoted by S(m1, ..., mn; α1, ..., αn), for which we find the generating function ...
Andrica, Dorin, Bagdasar, Ovidiu
core +1 more source
Geometry and complexity of O'Hara's algorithm [PDF]
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

