Abstract:
Let p be a prime and let C be a genus one curve over a number field k representing an element of order dividing p in the Shafarevich-Tate group of its Jacobian. We describe an algorithm which computes the set of D in the Shafarevich-Tate group such that pD = C and obtains explicit models for these D as curves in projective space. This leads to a practical algorithm for performing 9-descents on elliptic curves over the rationals.

Abstract:
We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.

Abstract:
We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative integer coefficients. We investigate the action of the Eulerian operators that give the recurrence for these generating functions. As a result we devise a recurrence for the coefficients but are unable to settle the conjecture. We examine generalizations of the conjecture and obtain a type B analog of the recurrence satisfied by the two-variable generating function. We also exhibit some connections to cyclic descents and cyclic inverse descents. Finally, we propose a combinatorial model in terms of statistics on inversion sequences.

Abstract:
For any abelian variety J over a global field k and an isogeny phi: J -> J, the Selmer group Sel^phi(J,k) is a subgroup of the Galois cohomology group H^1(Gal(ksep/k), J[phi]), defined in terms of local data. When J is the Jacobian of a cyclic cover of P^1 of prime degree p, the Selmer group has a quotient by a subgroup of order at most p that is isomorphic to the `fake Selmer group', whose definition is more amenable to explicit computations. In this paper we define in the same setting the `explicit Selmer group', which is isomorphic to the Selmer group itself and just as amenable to explicit computations as the fake Selmer group. This is useful for describing the associated covering spaces explicitly and may thus help in developing methods for second descents on the Jacobians considered.

Abstract:
Linked partitions are introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux are introduced by Steingr\'{i}msson and Williams in the study of totally positive Grassmannian cells. Let $[n]=\{1,2,\ldots,n\}$. Let $L(n,k)$ denote the set of linked partitions of $[n]$ with $k$ blocks, let $P(n,k)$ denote the set of permutations of $[n]$ with $k$ descents, and let $T(n,k)$ denote the set of permutation tableaux of length $n$ with $k$ rows. Steingr\'{i}msson and Williams found a bijection between the set of permutation tableaux of length $n$ with $k$ rows and the set of permutations of $[n]$ with $k$ weak excedances. Corteel and Nadeau gave a bijection from the set of permutation tableaux of length $n$ with $k$ columns to the set of permutations of $[n]$ with $k$ descents. In this paper, we establish a bijection between $L(n,k)$ and $P(n,k-1)$ and a bijection between $L(n,k)$ and $T(n,k)$. Restricting the latter bijection to noncrossing linked partitions, we find that the corresponding permutation tableaux can be characterized by pattern avoidance.

Abstract:
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

Abstract:
We develop a more general view of Stembridge's enriched $P$-partitions and use this theory to outline the structure of peak algebras for the symmetric group and the hyperoctahedral group. Initially we focus on commutative peak algebras, spanned by sums of permutations with the same number of peaks, where we consider several variations on the definition of "peak." Whereas Stembridge's enriched $P$-partitions are related to quasisymmetric functions (the dual coalgebra of Solomon's type A descent algebra), our generalized enriched $P$-partitions are related to type B quasisymmetric functions (the dual coalgebra of Solomon's type B descent algebra). Using these functions, we move on to explore (non-commutative) peak algebras spanned by sums of permutations with the same set of peaks. While some of these algebras have been studied before, our approach gives explicit structure constants with a combinatorial description.

Abstract:
We consider a special type of integer partitions in which the parts of the form $p^aq^b$, for some relatively prime integers $p$ and $q$, are restricted by divisibility conditions. We investigate the problems of generating and encoding those partitions and give some estimates for several partition functions.

Abstract:
We consider a special type of integer partitions in which the parts of the form $p^aq^b$, for some relatively prime integers $p$ and $q$, are restricted by divisibility conditions. We investigate the problems of generating and encoding those partitions and give some estimates for several partition functions.

Abstract:
We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an application, we consider the partially ordinal sum $P_n$ of $n$ copies of a given poset, which generalizes both the direct sum and the ordinal sum. We show that the sequence $\{f_{P_n}(\x)\}_{n\ge 1}$ satisfies a finite system of recurrence relations with respect to $n$. We illustrate the method by several examples, including a kind of 3-rowed posets and the multi-cube posets.