Random Cayley graphs and expanders

For every 1 > δ > 0 there exists a c = c(δ) > 0 such that for every group G of order n, and for a set S of c(δ) log n random elements in the group, the expected value of the second largest eigenvalue of the normalized adjacency matrix of the Cayley graph X(G, S) is at most (1 - δ). This implies that almost every such a graph is an ?(δ)-expander. For Abelian groups this is essentially tight, and explicit constructions can be given in some cases. © 1994 John Wiley & Sons, Inc.     

Schur-positive sets of permutations via products and grid classes

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper, we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.     

An adjoint-based pressure correction scheme

Incompressible flows are solenoidal, i. e. the divergence of the flow field is zero. This is an algebraic constraint on the solution in time. The pressure has to be determined, so that the constraint is fulfilled. To calculate the pressure often a Poisson equation is derived, which is then solved by an iterative method. Instead of this the constraint is here formulated as an optimization problem. The objective functional is taken as the square of the norm of the divergence. A gradient based optimization is performed to calculate the pressure in every time step of the simulation. By this an alternative iterative scheme is derived. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Enumeration and randomized constructions of hypertrees

Over 30 years ago, Kalai proved a beautiful d‐dimensional analog of Cayley's formula for the number of n‐vertex trees. He enumerated d‐dimensional hypertrees weighted by the squared size of their (d ? 1)‐dimensional homology group. This, however, does not answer the more basic problem of unweighted enumeration of d‐hypertrees, which is our concern here. Our main result, Theorem 1.4, significantly improves the lower bound for the number of d‐hypertrees. In addition, we study a random 1‐out model of d‐complexes where every (d ? 1)‐dimensional face selects a random d‐face containing it, and show that it has a negligible d‐dimensional homology.     

Q-switching an all-fiber laser using acousto-optic null coupler

A new method for Q-switching an all-fiber laser is presented. It is based on induced acoustic long period grating operating on a null coupler, which acts as acoustically controlled tunable output coupler. Q-switching is achieved by switching on and off the acoustic wave in a burst mode, thereby generating laser pulses that are ~400 times shorter than the acoustically controlled coupler’s rise time. Output pulse energy of 22 μJ and temporal width of ~100 ns were measured at a wavelength of 1.54 μm.     

Lampen und Erhitzungsvorrichtungen

Ohne Zusammenfassung