Hausdorff and upper box dimension estimate of hyperbolic recurrent sets

In this paper, under the open set condition we have determined the lower and upper bounds of the Hausdorff dimensions and the upper box-counting dimensions of the limit sets of hyperbolic recurrent iterated function systems in terms of the unique zeros h and H of the two pressure functions. In addition, we have estimated the bounds of h, H-dimensional Hausdorff and packing measures. The result in this paper generalizes existing results about fractal dimensions of many other iterated function systems.     

非光滑区域上非自治Navier-Stokes 方程非齐边界问题的吸引子

本文研究在2维Lipschitz区域上Navier-Stokes方程的非齐边界问题的长时间行为，在外力是时间的拟周期下，通过引入双参过程的概念，证明一致吸引子A的存在性，并给出一致吸引子A的Hausdorff维数的上界估计。     

Completely reducible hypersurfaces in a pencil

We study completely reducible fibers of pencils of hypersurfaces on Pn and associated codimension one foliations of Pn. Using methods from theory of foliations we obtain certain upper bounds for the number of these fibers as functions only of n. Equivalently this gives upper bounds for the dimensions of resonance varieties of hyperplane arrangements. We obtain similar bounds for the dimensions of the characteristic varieties of the arrangement complements.     

Dynamics in coupled oscillators with recurrent/random forcing, a PDE approach

The current paper is devoted to the study of coupled oscillators with recurrent/random forcing. Special attention is given to the solutions having the same recurrence/randomness as that of the forcing (recurrent/random solutions for short). By embedding coupled oscillators into coupled parabolic equations, it establishes a general theorem on the existence of recurrent/random solutions. It also finds conditions under which such solutions are unique. When the recurrent forcing is actually quasi-periodic or almost periodic, recurrent solutions are refereed to as quasi-periodic or almost periodic solutions in a weak sense and they are quasi-periodic or almost periodic in the classical sense under the uniqueness conditions. In addition, applications of the general theory to coupled Duffing type oscillators and Josephson junctions are considered and the results obtained extend several existing ones for quasi-periodic Duffing oscillators.     

Anderson localization for generic deterministic operators

We consider a class of ensembles of lattice Schrödinger operators with deterministic potentials, including quasi-periodic potentials with Diophantine frequencies, depending upon an infinite number of parameters in an auxiliary measurable space. Using a variant of the Multi-Scale Analysis, we prove Anderson localization for generic ensembles in the strong disorder regime and establish an analog of Minami-type bounds for spectral spacings.     

Generalization of the second Bogolyubov's theorem for non-almost periodic systems

The article is devoted to the generalization of the second Bogolyubov's theorem to non-almost periodic dynamical systems. We prove the analog of the second Bogolyubov's theorem for recurrent or pseudorecurrent dynamical systems in Banach spaces. Namely, we obtain the relation between a recurrent dynamical system and its averaged dynamical system. We also study existence of recurrent and pseudorecurrent motions (including special cases of periodic, quasi-periodic and almost periodic motions) in related nonautonomous systems.     

Periodic schedules for linear precedence constraints

We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the maximal period of a task.We recall first that this problem may be modelled using linear programming. A polynomial algorithm is then developed to solve it for a particular class of linear precedence graphs called unitary graphs. We also show that a periodic schedule may not exist for unitary graphs. In the general case, a decomposition of the linear precedence graph into unitary components is computed and we assume that a periodic schedule exists for each of these components. Lower bounds on the periods are exhibited and we show that an optimal periodic schedule may not achieve them. The notion of quasi-periodic schedule is then introduced and we prove that this new class of schedules always reaches these bounds.     

Lower bounds on the pathwidth of some grid-like graphs

We present proofs of lower bounds on the node search number of some grid-like graphs including two-dimensional grids, cylinders, tori and a variation we call “orb-webs”. Node search number is equivalent to pathwidth and vertex separation, which are all important graph parameters. Since matching upper bounds are not difficult to obtain, this implies that the pathwidth of these graphs is easily computed, because the bounds are simple functions of the graph dimensions. We also show matching upper and lower bounds on the node search number of equidimensional tori which are one less than the obvious upper bound.     

Tight estimates for general averaging applied to almost-periodic differential equations

Estimates are presented for the averaging method of ordinary differential equations. Previous results are improved by relaxing the conditions under which they hold, and by providing tight bounds for the estimations for almost-periodic differential equations and quasi-periodic differential equations.     

A Fourier formulation of the Frostman criterion for random graphs and its applications to wavelet series

In the paper by F. Roueff “Almost sure Hausdorff dimensions of graphs of random wavelet series” [J. Fourier Anal. Appl., to appear] lower bounds of the Hausdorff dimension of the graphs of random wavelet series (RWS) have been obtained essentially under the hypothesis that the wavelet coefficients have a bounded probability density function (p.d.f.) with respect to the Lebesgue measure. In this article we extend these lower bounds to classes of RWS that do not satisfy this hypothesis.     

Upper bounds in quantum dynamics

We develop a general method to bound the spreading of an entire wavepacket under Schrödinger dynamics from above. This method derives upper bounds on time-averaged moments of the position operator from lower bounds on norms of transfer matrices at complex energies.

This general result is applied to the Fibonacci operator. We find that at sufficiently large coupling, all transport exponents take values strictly between zero and one. This is the first rigorous result on anomalous transport.

For quasi-periodic potentials associated with trigonometric polynomials, we prove that all lower transport exponents and, under a weak assumption on the frequency, all upper transport exponents vanish for all phases if the Lyapunov exponent is uniformly bounded away from zero. By a well-known result of Herman, this assumption always holds at sufficiently large coupling. For the particular case of the almost Mathieu operator, our result applies for coupling greater than two.

     

Essential Dimension of Algebraic Groups and Integral Representations of Weyl Groups

Upper bounds on the essential dimension of algebraic groups can be found by examining related questions about the integral representation theory of lattices for their Weyl groups. We examine these questions in detail for all simple affine algebraic groups, expanding on work of Lorenz and Reichstein for PGL_n. This results in upper bounds on the essential dimensions of these simple affine algebraic groups which match or improve on the previously known upper bounds.     

The minimum size instance of a Pallet Loading Problem equivalence class

The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with edges parallel to the pallet’s edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI) of an equivalence class of PLP, and shows that every class has one and only one MSI. We develop bounds on the dimensions of box and pallet for the MSI of any class. Applying our new bounds on MSI dimensions, we present an algorithm for MSI generation and use it to enumerate all 3,080,730 equivalence classes with an area ratio (pallet area divided by box area) smaller than 101 boxes. Previous work only provides bounds on the ratio of box dimensions and only considers a subset of all classes presented here.     

Bounds for a class of stochastic recursive equations

In this note we develop a framework for computing upper and lower bounds of an exponential form for a class of stochastic recursive equations with uniformly recurrent Markov modulated inputs. These bounds generalize Kingman's bounds for queues with renewal inputs.     

Homology vanishing theorems for submanifolds

We relate intrinsic and extrinsic curvature invariants to the homology groups of submanifolds in space forms of nonnegative curvature. More precisely, we provide bounds for the squared length of the second fundamental form, or the Ricci curvature in terms of the mean curvature, which force homology to vanish in a range of intermediate dimensions. Moreover, we give examples which show that these conditions are sharp.

     

Best-possible bounds for the distribution of a sum — a problem of Kolmogorov

Summary Recently, in answer to a question of Kolmogorov, G.D. Makarov obtained best-possible bounds for the distribution function of the sumX+Y of two random variables,X andY, whose individual distribution functions,F _X andF _Y, are fixed. We show that these bounds follow directly from an inequality which has been known for some time. The techniques we employ, which are based on copulas and their properties, yield an insightful proof of the fact that these bounds are best-possible, settle the question of equality, and are computationally manageable. Furthermore, they extend to binary operations other than addition and to higher dimensions.     

An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.     

Mathematical analysis of plasmonic resonance for 2-D photonic crystal

In this article, we study the plasmonic resonance of infinite photonic crystal mounted by the double negative nanoparticles in two dimensions. The corresponding physical model is described by the Helmholz equation with so called Bloch wave condition in a periodic domain. By using the quasi-periodic layer potential techniques and the spectral theorem of quasi-periodic Neumann–Poincaré operator, the quasi-static expansion of the near field in the presence of nanoparticles is derived. Furthermore, when the magnetic permeability of nanoparticles satisfies the Drude model, we give the conditions under which the plasmonic resonance occurs, and the rate of blow up of near field energy with respect to nanoparticle's bulk electron relaxation rate and filling factor are also obtained. It indicates that one can appropriately control the bulk electron relaxation rate or filling factor of nanoparticle in photonic crystal structure such that the near field energy attains its maximum, and enhancing the efficiency of energy utilization.     

Recollements and homological dimensions

We investigate the behavior of the homological dimensions under recollements of derived categories of algebras. In particular, we establish a series of new bounds among the self-injective dimensions or ?-dimensions of the algebras linked by recollements of derived module categories.