9,096,287 research outputs found
Generating functions for Wilf equivalence under generalized factor order
Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on
words comprised of letters from a partially ordered set by
setting if there is a subword of of the same length as
such that the -th character of is greater than or equal to the -th
character of for all . This subword is called an embedding of
into . For the case where is the positive integers with the usual
ordering, they defined the weight of a word to be
, and the corresponding weight
generating function . They then
defined two words and to be Wilf equivalent, denoted , if
and only if . They also defined the related generating
function where
is the set of all words such that the only embedding of
into is a suffix of , and showed that if and only if
. We continue this study by giving an explicit formula for
if factors into a weakly increasing word followed by a weakly
decreasing word. We use this formula as an aid to classify Wilf equivalence for
all words of length 3. We also show that coefficients of related generating
functions are well-known sequences in several special cases. Finally, we
discuss a conjecture that if then and must be
rearrangements, and the stronger conjecture that there also must be a
weight-preserving bijection such
that is a rearrangement of for all .Comment: 23 page
Sharp energy estimates for nonlinear fractional diffusion equations
We study the nonlinear fractional equation in
, for all fractions and all nonlinearities . For every
fractional power , we obtain sharp energy estimates for bounded
global minimizers and for bounded monotone solutions. They are sharp since they
are optimal for solutions depending only on one Euclidian variable.
As a consequence, we deduce the one-dimensional symmetry of bounded global
minimizers and of bounded monotone solutions in dimension whenever . This result is the analogue of a conjecture of De Giorgi on
one-dimensional symmetry for the classical equation in
. It remains open for and , and also for
and all .Comment: arXiv admin note: text overlap with arXiv:1004.286
Amalgams of Inverse Semigroups and C*-algebras
An amalgam of inverse semigroups [S,T,U] is full if U contains all of the
idempotents of S and T. We show that for a full amalgam [S,T,U], the C*-algebra
of the inverse semigroup amaglam of S and T over U is the C*-algebraic amalgam
of C*(S) and C*(T) over C*(U). Using this result, we describe certain
amalgamated free products of C*-algebras, including finite-dimensional
C*-algebras, the Toeplitz algebra, and the Toeplitz C*-algebras of graphs
- …
