10,554 research outputs found
Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials)
Fix an integer partition lambda that has no more than n parts. Let beta be a
weakly increasing n-tuple with entries from {1,..,n}. The flagged Schur
function indexed by lambda and beta is a polynomial generating function in x_1,
.., x_n for certain semistandard tableaux of shape lambda. Let pi be an
n-permutation. The type A Demazure character (key polynomial, Demazure
polynomial) indexed by lambda and pi is another such polynomial generating
function. Reiner and Shimozono and then Postnikov and Stanley studied
coincidences between these two families of polynomials. Here their results are
sharpened by the specification of unique representatives for the equivalence
classes of indexes for both families of polynomials, extended by the
consideration of more general beta, and deepened by proving that the polynomial
coincidences also hold at the level of the underlying tableau sets. Let R be
the set of lengths of columns in the shape of lambda that are less than n.
Ordered set partitions of {1,..,n} with block sizes determined by R, called
R-permutations, are used to describe the minimal length representatives for the
parabolic quotient of the nth symmetric group specified by the set
{1,..,n-1}\R. The notion of 312-avoidance is generalized from n-permutations to
these set partitions. The R-parabolic Catalan number is defined to be the
number of these. Every flagged Schur function arises as a Demazure polynomial.
Those Demazure polynomials are precisely indexed by the R-312-avoiding
R-permutations. Hence the number of flagged Schur functions that are distinct
as polynomials is shown to be the R-parabolic Catalan number. The projecting
and lifting processes that relate the notions of 312-avoidance and of
R-312-avoidance are described with maps developed for other purposes.Comment: 27 pages, 2 figures. Identical to v.2, except for the insertion of
the publication data for the DMTCS journal (dates and volume/issue/number).
This is two-thirds of our preprint "Parabolic Catalan numbers count flagged
Schur functions; Convexity of tableau sets for Demazure characters",
arXiv:1612.06323v
A teaching experiment to foster the conceptual understanding of multiplication based on children's literature to facilitate dialogic learning
The importance of conceptual understanding as opposed to low-level procedural knowledge in mathematics has been well documented (Hiebert & Carpenter, 1992). Development of conceptual understanding of multiplication is fostered when students recognise the equal group structure that is common in all multiplicative problems (Mulligan & Mitchelmore, 1996). This paper reports on the theoretical development of a transformative teaching experiment based on conjecture-driven research design (Confrey & Lachance, 1999) that aims to enhance Year 3 students’ conceptual understanding of multiplication. The teaching experiment employs children’s literature as a motivational catalyst and mediational tool for students to explore and engage in multiplication activities and dialogue. The SOLO taxonomy (Biggs & Collis, 1989) is used to both frame the novel teaching and learning activities, as well as assess the level of students’ conceptual understanding of multiplication as displayed in the products derived from the experiment. Further, student’s group interactions will be analysed in order to investigate the social processes that may contribute positively to learning
Temporal Aperture Modulation
The two types of modulation techniques useful to X-ray imaging are reviewed. The use of optimum coded temporal aperature modulation is shown, in certain cases, to offer an advantage over a spatial aperture modulator. Example applications of a diffuse anisotropic X-ray background experiment and a wide field of view hard X-ray imager are discussed
Low error measurement-free phase gates for qubus computation
We discuss the desired criteria for a two-qubit phase gate and present a
method for realising such a gate for quantum computation that is
measurement-free and low error. The gate is implemented between qubits via an
intermediate bus mode. We take a coherent state as the bus and use cross-Kerr
type interactions between the bus and the qubits. This new method is robust
against parameter variations and is thus low error. It fundamentally improves
on previous methods due its deterministic nature and the lack of approximations
used in the geometry of the phase rotations. This interaction is applicable
both to solid state and photonic qubit systems.Comment: 6 pages, 4 figures. Published versio
Dynamic mode decomposition with control
We develop a new method which extends Dynamic Mode Decomposition (DMD) to
incorporate the effect of control to extract low-order models from
high-dimensional, complex systems. DMD finds spatial-temporal coherent modes,
connects local-linear analysis to nonlinear operator theory, and provides an
equation-free architecture which is compatible with compressive sensing. In
actuated systems, DMD is incapable of producing an input-output model;
moreover, the dynamics and the modes will be corrupted by external forcing. Our
new method, Dynamic Mode Decomposition with control (DMDc), capitalizes on all
of the advantages of DMD and provides the additional innovation of being able
to disambiguate between the underlying dynamics and the effects of actuation,
resulting in accurate input-output models. The method is data-driven in that it
does not require knowledge of the underlying governing equations, only
snapshots of state and actuation data from historical, experimental, or
black-box simulations. We demonstrate the method on high-dimensional dynamical
systems, including a model with relevance to the analysis of infectious disease
data with mass vaccination (actuation).Comment: 10 pages, 4 figure
Universal quantum computation by the unitary control of ancilla qubits and using a fixed ancilla-register interaction
We characterise a model of universal quantum computation where the register
(computational) qubits are controlled by ancillary qubits, using only a single
fixed interaction between register and ancillary qubits. No additional access
is required to the computational register and the dynamics of both the register
and ancilla are unitary. This scheme is inspired by the measurement-based
ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010],
but does not require measurements of the ancillas, and in this respect is
similar to the original gate based model of quantum computation. We consider
what possible forms this ancilla-register interaction can take, with a proof
that the interaction is necessarily locally equivalent to SWAP combined with an
entangling controlled gate. We further show which Hamiltonians can create such
interactions and discuss two examples; the two-qubit XY Hamiltonian and a
particular case of the XXZ Hamiltonian. We then give an example of a simple,
finite and fault tolerant gate set for universal quantum computation in this
model.Comment: 10 pages, Published versio
Study of outgassing and decomposition of Space Shuttle heat protection tiles, fillers and adhesive
A purge and trap technique which was employed to collect and separate the chemicals desorbing from the space shuttle heat protection tiles is described. The instrumentation included a mass spectrometer and gas chromatograph
- …
