Optimal rectangle packing

We consider the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. We present two different constraint-satisfaction formulations of this problem. The first searches a space of absolute placements of rectangles in the enclosing rectangle, while the other searches a space of relative placements between pairs of rectangles. Both approaches dramatically outperform previous approaches to optimal rectangle packing. For problems where the rectangle dimensions have low precision, such as small integers, absolute placement is generally more efficient, whereas for rectangles with high-precision dimensions, relative placement will be more effective. In two sets of experiments, we find both the smallest rectangles and squares that can contain the set of squares of size 1×1, 2×2,…,N×N, for N up to 27. In addition, we solve an open problem dating to 1966, concerning packing the set of consecutive squares up to 24×24 in a square of size 70×70. Finally, we find the smallest enclosing rectangles that can contain a set of unoriented rectangles of size 1×2, 2×3, 3×4,…,N×(N+1), for N up to 25.     

Conceptualizations of slope in Mexican intended curriculum

Slope is a fundamental mathematics concept in middle and high school that transcends to the university level. An understanding of slope is needed at the university level since slope plays an important role in understanding problems involving variation and change. In this study Mexican curricula documents were examined to determine which conceptualizations of slope are addressed in the intended mathematics curriculum. To explain the results, we use conceptualizations of slope identified in previous research. Our findings reveal that, to a certain extent, the conceptualizations proposed in the Mexican intended mathematics curriculum differ slightly in terms of the emphasis and timing of instruction from what others have identified in the U.S., with slope as a geometric ratio receiving less emphasis in the Mexican curriculum. There was also noted discontinuity within the Mexican curriculum in introducing slope in grade 9 and subsequently introducing of linear functions in grade 10 without explicit mention of slope. Suggestions are made for future studies, both to consider the conceptualizations of slope promoted in the Mexican textbooks and the impact they have in classroom instruction and student learning of slope.     

Coherent storage of photoexcited triplet states using 29Si nuclear spins in silicon

Pulsed electron paramagnetic resonance spectroscopy of the photoexcited, metastable triplet state of the oxygen-vacancy center in silicon reveals that the lifetime of the m(s)=±1 sublevels differs significantly from that of the m(s)=0 state. We exploit this significant difference in decay rates to the ground singlet state to achieve nearly ~100% electron-spin polarization within the triplet. We further demonstrate the transfer of a coherent state of the triplet electron spin to, and from, a hyperfine-coupled, nearest-neighbor (29)Si nuclear spin. We measure the coherence time of the (29)Si nuclear spin employed in this operation and find it to be unaffected by the presence of the triplet electron spin and equal to the bulk value measured by nuclear magnetic resonance.     

The categorified Heisenberg algebra I: A combinatorial representation

We show how Khovanov's categorification of the Heisenberg algebra arises as a linearization of a discrete combinatorial structure in the bicategory of spans of groupoids. We also treat a categorification of $U({\mathrm{sl}}_n)$ in a similar way.     

The S′-convolution with singular kernels in the Euclidean case and the product domain case

We characterize those tempered distributions which are S′-convolvable with a given class of singular convolution kernels. We study both, the Euclidean case and the product domain case. In the Euclidean case, we consider a class of kernels that includes Riesz kernels, Calderón–Zygmund singular convolution kernels, finite part distributions defined by hypersingular convolution kernels, and Hörmander multipliers. In the product domain case, we consider a class of singular kernels introduced by Fefferman and Stein as a generalization of the n-dimensional Hilbert kernel.     

A combinatorial formula for Macdonald polynomials

In this paper we use the combinatorics of alcove walks to give uniform combinatorial formulas for Macdonald polynomials for all Lie types. These formulas resemble the formulas of Haglund, Haiman and Loehr for Macdonald polynomials of type GLn. At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent and Littelmann).     

Identifying preferred solutions to Multi-Objective Binary Optimisation problems,with an application to the Multi-Objective Knapsack Problem

In this paper we present a new framework for identifying preferred solutions to multi-objective binary optimisation problems. We develop the necessary theory which leads to new formulations that integrate the decision space with the space of criterion weights. The advantage of this is that it allows for incorporating preferences directly within a unique binary optimisation problem which identifies efficient solutions and associated weights simultaneously. We discuss how preferences can be incorporated within the formulations and also describe how to accommodate the selection of weights when the identification of a unique solution is required. Our results can be used for designing interactive procedures for the solution of multi-objective binary optimisation problems. We describe one such procedure for the multi-objective multi-dimensional binary knapsack formulation of the portfolio selection problem.