2,136 research outputs found
A numerical method for oscillatory integrals with coalescing saddle points
The value of a highly oscillatory integral is typically determined
asymptotically by the behaviour of the integrand near a small number of
critical points. These include the endpoints of the integration domain and the
so-called stationary points or saddle points -- roots of the derivative of the
phase of the integrand -- where the integrand is locally non-oscillatory.
Modern methods for highly oscillatory quadrature exhibit numerical issues when
two such saddle points coalesce. On the other hand, integrals with coalescing
saddle points are a classical topic in asymptotic analysis, where they give
rise to uniform asymptotic expansions in terms of the Airy function. In this
paper we construct Gaussian quadrature rules that remain uniformly accurate
when two saddle points coalesce. These rules are based on orthogonal
polynomials in the complex plane. We analyze these polynomials, prove their
existence for even degrees, and describe an accurate and efficient numerical
scheme for the evaluation of oscillatory integrals with coalescing saddle
points
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises
A hypergraph is said to be -colorable if its vertices can be colored
with colors so that no hyperedge is monochromatic. -colorability is a
fundamental property (called Property B) of hypergraphs and is extensively
studied in combinatorics. Algorithmically, however, given a -colorable
-uniform hypergraph, it is NP-hard to find a -coloring miscoloring fewer
than a fraction of hyperedges (which is achieved by a random
-coloring), and the best algorithms to color the hypergraph properly require
colors, approaching the trivial bound of as
increases.
In this work, we study the complexity of approximate hypergraph coloring, for
both the maximization (finding a -coloring with fewest miscolored edges) and
minimization (finding a proper coloring using fewest number of colors)
versions, when the input hypergraph is promised to have the following stronger
properties than -colorability:
(A) Low-discrepancy: If the hypergraph has discrepancy ,
we give an algorithm to color the it with colors.
However, for the maximization version, we prove NP-hardness of finding a
-coloring miscoloring a smaller than (resp. )
fraction of the hyperedges when (resp. ). Assuming
the UGC, we improve the latter hardness factor to for almost
discrepancy- hypergraphs.
(B) Rainbow colorability: If the hypergraph has a -coloring such
that each hyperedge is polychromatic with all these colors, we give a
-coloring algorithm that miscolors at most of the
hyperedges when , and complement this with a matching UG
hardness result showing that when , it is hard to even beat the
bound achieved by a random coloring.Comment: Approx 201
Reflected Brownian motions in the KPZ universality class
This book presents a detailed study of a system of interacting Brownian
motions in one dimension. The interaction is point-like such that the -th
Brownian motion is reflected from the Brownian motion with label . This
model belongs to the Kardar-Parisi-Zhang (KPZ) universality class. In fact,
because of the singular interaction, many universal properties can be
established with rigor. They depend on the choice of initial conditions.
Discussion addresses packed and periodic initial conditions, stationary initial
conditions, and mixtures thereof. The suitably scaled spatial process will be
proven to converge to an Airy process in the long time limit. A chapter on
determinantal random fields and another one on Airy processes are added to have
the notes self-contained. This book serves as an introduction to the KPZ
universality class, illustrating the main concepts by means of a single model
only. It will be of interest to readers from interacting diffusion processes
and non-equilibrium statistical mechanics.Comment: arXiv admin note: text overlap with arXiv:1502.0146
Computing parametric rational generating functions with a primal Barvinok algorithm
Computations with Barvinok's short rational generating functions are
traditionally being performed in the dual space, to avoid the combinatorial
complexity of inclusion--exclusion formulas for the intersecting proper faces
of cones. We prove that, on the level of indicator functions of polyhedra,
there is no need for using inclusion--exclusion formulas to account for
boundary effects: All linear identities in the space of indicator functions can
be purely expressed using half-open variants of the full-dimensional polyhedra
in the identity. This gives rise to a practically efficient, parametric
Barvinok algorithm in the primal space.Comment: 16 pages, 1 figure; v2: Minor corrections, new example and summary of
algorithm; submitted to journa
- …