The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

Facile non‐lithographic route to highly aligned silica nanopatterns using unidirectionally aligned polystyrene‐block‐polydimethylsiloxane films

Thin films (monolayer and bilayer) of cylinder forming polystyrene‐block‐polydimethylsiloxane (PS‐b‐PDMS) were shear aligned by the swelling and deswelling of a crosslinked PDMS pad that was physically adhered to the film during solvent vapor annealing. The nanostructures formed by self‐assembly were exposed to ultraviolet‐ozone to partially oxidize the PDMS, followed by calcination in air at 500 °C. In this process, the PS segments were fully decomposed, while the PDMS yielded silica nanostructures. The highly aligned PDMS cylinders were thus deposited as silica nanolines on the silicon substrate. Using a bilayer film, the center‐to‐center distance of these features were effectively halved from 38 to 19 nm. Similarly, by sequential shear‐alignment of two distinct layers, a rhombic array of silica nanolines was fabricated. This methodology provides a facile route to fabricating complex topographically patterned nanostructures. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1058–1064     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

利用V型三能级原子与相干态光场Raman相互作用传送未知原子态

描述了简并V型三能级原子与单模相干态光场的Raman相互作用,获得了处于激发态单态的原子与相干态光场相互作用的结果.利用探测原子与光场的相互作用将原子和光场制备成最大缠结态,并注入待测原子,通过原子与腔模构成的Bell基矢演化,对腔场进行选择性探测,获得探测原子相互作用后可能的量子状态,然后对待测原子与腔场进行联合探测,接着对探测原子的量子状态实施幺正变换,就将探测原子制备到待测原子的初始量子态上,从而实现未知原子态的隐形传送.     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Compact directed acyclic word graphs for a sliding window

Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window.     

Application of directed metallation in synthesis. Part 3: Studies in the synthesis of (±)-semivioxanthin and its analogues

The synthesis of several analogues of (±)-semivioxanthin including five thiophene analogues, using directed metalation are reported. The strategy consisted of the synthesis of functionalized naphthalene or benzo[b]thiophene as building blocks followed by annelation of the pyrone.