arxivmath's Journal
[Most Recent Entries]
[Calendar View]
[Friends View]
Tuesday, June 23rd, 2009
| Time |
Event |
| 6:41a |
| | 6:41a |
| | 6:41a |
Freiman's theorem for solvable groups. (arXiv:0906.3535v1 [math.CO])
Freiman's theorem for solvable groups. (arXiv:0906.3535v1 [math.CO])
Authors: Terence Tao
Freiman's theorem asserts, roughly speaking, if that a finite set in a
torsion-free abelian group has small doubling, then it can be efficiently
contained in (or controlled by) a generalised arithmetic progression. This was
generalised by Green and Ruzsa to arbitrary abelian groups, where the
controlling object is now a coset progression. We extend these results further
to solvable groups of bounded derived length, in which the coset progressions
are replaced by the more complicated notion of a ``coset nilprogression''. As
one consequence of this result, any subset of such a solvable group of small
doubling is is controlled by a set whose iterated products grow polynomially,
and which are contained inside a virtually nilpotent group. As another
application we establish a strengthening of the Milnor-Wolf theorem that all
solvable groups of polynomial growth are virtually nilpotent, in which only one
large ball needs to be of polynomial size. This result complements recent work
of Breulliard-Green, Fisher-Katz-Peng, and Sanders.
read more at math updates on arXiv.org | | 6:41a |
| | 6:41a |
Decompositions into subgraphs of small diameter. (arXiv:0906.3530v1 [math.CO])
Decompositions into subgraphs of small diameter. (arXiv:0906.3530v1 [math.CO])
Authors: Jacob Fox, Benny Sudakov
We investigate decompositions of a graph into a small number of low diameter
subgraphs. Let P(n,\epsilon,d) be the smallest k such that every graph G=(V,E)
on n vertices has an edge partition E=E_0 \cup E_1 \cup ... \cup E_k such that
|E_0| \leq \epsilon n^2 and for all 1 \leq i \leq k the diameter of the
subgraph spanned by E_i is at most d. Using Szemer\'edi's regularity lemma,
Polcyn and Ruci\'nski showed that P(n,\epsilon,4) is bounded above by a
constant depending only \epsilon. This shows that every dense graph can be
partitioned into a small number of ``small worlds'' provided that few edges can
be ignored. Improving on their result, we determine P(n,\epsilon,d) within an
absolute constant factor, showing that P(n,\epsilon,2) = \Theta(n) is unbounded
for \epsilon < 1/4, P(n,\epsilon,3) = \Theta(1/\epsilon^2) for \epsilon >
n^{-1/2} and P(n,\epsilon,4) = \Theta(1/\epsilon) for \epsilon > n^{-1}. We
also prove that if G has large minimum degree, all the edges of G can be
covered by a small number of low diameter subgraphs. Finally, we extend some of
these results to hypergraphs, improving earlier work of Polcyn, R\"odl,
Ruci\'nski, and Szemer\'edi.
read more at math updates on arXiv.org | | 6:41a |
| | 6:41a |
| | 6:41a |
| | 6:41a |
Conformal Mappings and Dispersionless Toda hierarchy II: General String Equations. (arXiv:0906.3565v
Conformal Mappings and Dispersionless Toda hierarchy II: General String Equations. (arXiv:0906.3565v1 [math-ph])
Authors: Lee-Peng Teo
In this article, we classify the solutions of the dispersionless Toda
hierarchy into degenerate and non-degenerate cases. We show that every
non-degenerate solution is determined by a function $\mathcal{H}(z_1,z_2)$ of
two variables. We interpret these non-degenerate solutions as defining
evolutions on the space $\mathfrak{D}$ of pairs of conformal mappings $(g,f)$,
where $g$ is a univalent function on the exterior of the unit disc, $f$ is a
univalent function on the unit disc, normalized such that $g(\infty)=\infty$,
$f(0)=0$ and $f'(0)g'(\infty)=1$. For each solution, we show how to define the
natural time variables $t_n, n\in\Z$, as complex coordinates on the space
$\mathfrak{D}$. We also find explicit formulas for the tau function of the
dispersionless Toda hierarchy in terms of $\mathcal{H}(z_1, z_2)$. Imposing
some conditions on the function $\mathcal{H}(z_1, z_2)$, we show that the
dispersionless Toda flows can be naturally restricted to the subspace $\Sigma$
of $\mathfrak{D}$ defined by $f(w)=1/\overline{g(1/\bar{w})}$. This recovers
the result of Zabrodin.
read more at math updates on arXiv.org | | 6:41a |
| | 6:41a |
A Variance Reduction Method for Parametrized Stochastic Differential Equations using the Reduced Bas
A Variance Reduction Method for Parametrized Stochastic Differential Equations using the Reduced Basis Paradigm. (arXiv:0906.3600v1 [math.NA])
Authors: Sebastien Boyaval, Tony Lelievre
In this work, we develop a reduced-basis approach for the efficient
computation of parametrized expected values, for a large number of parameter
values, using the control variate method to reduce the variance. Two algorithms
are proposed to compute online, through a cheap reduced-basis approximation,
the control variates for the computation of a large number of expectations of a
functional of a parametrized It\^o stochastic process (solution to a
parametrized stochastic differential equation). For each algorithm, a reduced
basis of control variates is pre-computed offline, following a so-called greedy
procedure, which minimizes the variance among a trial sample of the output
parametrized expectations. Numerical results in situations relevant to
practical applications (calibration of volatility in option pricing, and
parameter-driven evolution of a vector field following a Langevin equation from
kinetic theory) illustrate the efficiency of the method.
read more at math updates on arXiv.org | | 6:41a |
| | 6:41a |
| | 6:41a |
Self-Triggered Control: trading actuation for computation. (arXiv:0906.3588v1 [math.OC])
Self-Triggered Control: trading actuation for computation. (arXiv:0906.3588v1 [math.OC])
Authors: Manuel Mazo Jr., Adolfo Anta, Paulo Tabuada
Event-triggered and self-triggered control have recently been proposed as
alternatives to the well established periodic implementation of control loops
on digital platforms. In a self-triggered implementation, the control task is
responsible for computing the new actuator values as well as the next instant
of time at which the state should be sampled, the control law recomputed, and
the actuator values updated. In between these time instants, the system under
control requires no attention and can operate in open loop. Self-triggered
implementations can be seen as double edged swords: on the one hand, by using
the state of the plant to determine when the control law needs to be
recomputed, desired levels of control performance are enforced while
drastically reducing the resources (processor time, communication bandwidth,
etc) used for control; on the other hand, by operating the plant in open loop
for extended periods of time, robustness of self-triggered implementations
becomes an honest concern. In this paper we propose a self-triggered
implementation for linear systems achieving exponential input-to-state
stability, hence addressing the robustness concerns. Moreover, the proposed
implementation computes the largest possible times during which the plant can
operate in open loop while meeting desired performance levels and subject to
the computational capabilities of the digital platform.
read more at math updates on arXiv.org | | 6:41a |
| | 6:41a |
| | 6:41a |
| | 6:41a |
| | 6:41a |
| | 6:41a |
Cascades and e-invisibility. (arXiv:0906.3567v1 [math.DS])
Cascades and e-invisibility. (arXiv:0906.3567v1 [math.DS])
Authors: Yulij Ilyashenko, Denis Volk
We consider statistical attractors of locally typical dynamical systems and
their ``e-invisible'' subsets: parts of the attractors whose neighborhoods are
visited by orbits with an average frequency of less than e << 1. For
extraordinarily small values of e (say, smaller than 2^(-10^6)), an observer
virtually never sees these parts when following a generic orbit.
A trivial reason for e-invisibility in a generic dynamical system may be
either a high Lipshitz constant (~1/e) of the mapping (i.e. it badly distorts
the metric) or its proximity (~e) to the structurally unstable dynamical
systems. However Ilyashenko and Negut [IN] provided a locally typical example
of dynamical systems with an e-invisible set and a uniform moderate (<100)
Lipshitz constant independent on e. These dynamical systems from [IN] are also
|ln e|-distant from structurally unstable dynamical systems (in the class S of
skew products).
We further develop the example of [IN] to provide a better rate of
invisibility while staying at the same distance away from the structurally
unstable dynamical systems. We give an explicit example of C^1-balls in the
space of ``step'' skew products over the Bernoulli shift such that for each
dynamical system from this ball a large portion of the statistical attractor is
invisible. Systems that are c/n-distant from structurally unstable ones (in the
class S) have rate of invisibility e = 2^(-n^k) where 3k is the Hausdorff
dimension of the phase space.
read more at math updates on arXiv.org | | 6:41a |
|
|