Related papers: P-partitions revisited
We recast elliptic surfaces over the projective line in terms of the non-commutative tori and one-parameter families of the periodic continued fractions. The correspondence is used to study the Picard numbers, the ranks and the minimal…
A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…
A review of the present knowledge on polarized parton distributions is given. The effects of perturbative evolution on these distributions are discussed qualitatively and a comparison of various recent parametrizations is made.
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
An introductory to generalized parton distributions is given which emphasizes their spectral property and its uses as well as the equivalence of various GPD representations. Furthermore, the status of the theory and phenomenology of hard…
The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…
Let S be a site. We introduce the notion of extensions of strictly commutative Picard S-stacks. We define the pull-back, the push-down, and the sum of such extensions and we compute their homological interpretation: if P and Q are two…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
For a finite poset $P$, we study the expected size of the intersection of two independent uniformly random antichains. Equivalently, we evaluate the sum of $|A\cap A'|$ over all ordered pairs of antichains. For general posets this statistic…
We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…
We describe a "cellular" approach to the computation of the cohomology of a poset with coefficients in a presheaf. A cellular cochain complex is constructed, described explicitly and shown to compute the cohomology under certain…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
In this paper, we study non-linear differential equations associated with Legendre polynomials and their applications. From our study of non- linear differential equations, we derive some new and explicit identities for Legendre…
We extend the use of derivative dispersion relations to the study of slopes of the real and imaginary amplitudes in pp and p-pbar elastic scattering. The new relations are tested against the solutions for the amplitudes obtained in the…
We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…
A somewhat pretentious presentation of number systems (N, Z, Q, R, C, Q_p, >...). The problem of a p-adic characterisation of good-reduction p-adic curves is posed.
The $(P, \omega)$-partition generating function of a labeled poset $(P, \omega)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…