@article{243,
abstract = {Let P(t) ∈ ℚ[t] be an irreducible quadratic polynomial and suppose that K is a quartic extension of ℚ containing the roots of P(t). Let N K/ℚ(X) be a full norm form for the extension K/ℚ. We show that the variety P(t) =N K/ℚ(X)≠ 0 satisfies the Hasse principle and weak approximation. The proof uses analytic methods.},
author = {Timothy Browning and Heath-Brown, Roger},
journal = {Geometric and Functional Analysis},
number = {5},
pages = {1124 -- 1190},
publisher = {Springer Basel},
title = {{Quadratic polynomials represented by norm forms}},
doi = {10.1007/s00039-012-0168-5},
volume = {22},
year = {2012},
}
@article{2803,
abstract = {Recent numerical studies suggest that in pipe and related shear flows, the region of phase space separating laminar from turbulent motion is organized by a chaotic attractor, called an edge state, which mediates the transition process. We here confirm the existence of the edge state in laboratory experiments. We observe that it governs the dynamics during the decay of turbulence underlining its potential relevance for turbulence control. In addition we unveil two unstable traveling wave solutions underlying the experimental flow fields. This observation corroborates earlier suggestions that unstable solutions organize turbulence and its stability border.},
author = {de Lózar, Alberto and Mellibovsky, Fernando and Avila, Marc and Björn Hof},
journal = {Physical Review Letters},
number = {21},
publisher = {American Physical Society},
title = {{Edge state in pipe flow experiments}},
doi = {10.1103/PhysRevLett.108.214502},
volume = {108},
year = {2012},
}
@article{2904,
abstract = {Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences.},
author = {Pausinger, Florian},
journal = {Journal de Theorie des Nombres des Bordeaux},
number = {3},
pages = {729 -- 749},
publisher = {Universite de Bordeaux III},
title = {{Weak multipliers for generalized van der Corput sequences}},
doi = {10.5802/jtnb.819},
volume = {24},
year = {2012},
}
@article{2911,
abstract = {We have selected problems that may not yet be well known, but have the
potential to push the research in interesting directions. In particular, we state
problems that do not require specific knowledge outside the standard circle of ideas
in discrete geometry. Despite the relatively simple statements, these problems are
related to current research and their solutions are likely to require new ideas and
approaches. We have chosen problems from different fields to make this short paper
attractive to a wide range of specialists.},
author = {Herbert Edelsbrunner and Ivanov, Alexander and Karasev, Roman},
journal = {Automatic Control and Computer Sciences},
publisher = {Springer},
title = {{Open problems in discrete and computational geometry}},
volume = {in print},
year = {2012},
}
@unpublished{2928,
abstract = { This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. },
author = {Kolmogorov, Vladimir and Schoenemann, Thomas},
booktitle = {arXiv},
publisher = {ArXiv},
title = {{Generalized sequential tree-reweighted message passing}},
year = {2012},
}