56,083 research outputs found
Discrete piecewise linear functions
The concept of permutograph is introduced and properties of integral
functions on permutographs are established. The central result characterizes
the class of integral functions that are representable as lattice polynomials.
This result is used to establish lattice polynomial representations of
piecewise linear functions on convex domains and continuous selectors on linear
orders.Comment: 17 pages, 4 figures, Fig.2.1 label correcte
Asymptotic behavior of some statistics in Ewens random permutations
The purpose of this article is to present a general method to find limiting
laws for some renormalized statistics on random permutations. The model
considered here is Ewens sampling model, which generalizes uniform random
permutations. We describe the asymptotic behavior of a large family of
statistics, including the number of occurrences of any given dashed pattern.
Our approach is based on the method of moments and relies on the following
intuition: two events involving the images of different integers are almost
independent.Comment: 32 pages: final version for EJP, produced by the author. An extended
abstract of 12 pages, published in the proceedings of AofA 2012, is also
available as version
Central limit theorems for patterns in multiset permutations and set partitions
We use the recently developed method of weighted dependency graphs to prove
central limit theorems for the number of occurrences of any fixed pattern in
multiset permutations and in set partitions. This generalizes results for
patterns of size 2 in both settings, obtained by Canfield, Janson and
Zeilberger and Chern, Diaconis, Kane and Rhoades, respectively.Comment: version 2 (52 pages) implements referee's suggestions and uses
journal layou
Symmetries and Paraparticles as a Motivation for Structuralism
This paper develops an analogy proposed by Stachel between general relativity
(GR) and quantum mechanics (QM) as regards permutation invariance. Our main
idea is to overcome Pooley's criticism of the analogy by appeal to
paraparticles.
In GR the equations are (the solution space is) invariant under
diffeomorphisms permuting spacetime points. Similarly, in QM the equations are
invariant under particle permutations. Stachel argued that this feature--a
theory's `not caring which point, or particle, is which'--supported a
structuralist ontology.
Pooley criticizes this analogy: in QM the (anti-)symmetrization of fermions
and bosons implies that each individual state (solution) is fixed by each
permutation, while in GR a diffeomorphism yields in general a distinct, albeit
isomorphic, solution.
We define various versions of structuralism, and go on to formulate Stachel's
and Pooley's positions, admittedly in our own terms. We then reply to Pooley.
Though he is right about fermions and bosons, QM equally allows more general
types of symmetry, in which states (vectors, rays or density operators) are not
fixed by all permutations (called `paraparticle states'). Thus Stachel's
analogy is revived.Comment: 45 pages, Latex, 3 Figures; forthcoming in British Journal for the
Philosophy of Scienc
- …