Partial Fourier approximation of the Lamé equations in axisymmetric domains

In this paper, we study the partial Fourier method for treating the Lamé equations in three‐dimensional axisymmetric domains subjected to non‐axisymmetric loads. We consider the mixed boundary value problem of the linear theory of elasticity with the displacement û , the body force f̂ ϵ (L₂)³ and homogeneous Dirichlet and Neumann boundary conditions. The partial Fourier decomposition reduces, without any error, the three‐dimensional boundary value problem to an infinite sequence of two‐dimensional boundary value problems, whose solutions û _n (n = 0, 1, 2,…) are the Fourier coefficients of û . This process of dimension reduction is described, and appropriate function spaces are given to characterize the reduced problems in two dimensions. The trace properties of these spaces on the rotational axis and some properties of the Fourier coefficients û _n are proved, which are important for further numerical treatment, e.g. by the finite‐element method. Moreover, generalized completeness relations are described for the variational equation, the stresses and the strains. The properties of the resulting system of two‐dimensional problems are characterized. Particularly, a priori estimates of the Fourier coefficients û _n and of the error of the partial Fourier approximation are given. Copyright © 1999 John Wiley & Sons, Ltd.     

Notes on the variance of the number of maxima in three dimensions

We study the number of maxima on a d‐dimensional cube. We give an exact expression for the variance in three dimensions, which is easy to express as a polynomial in log n and therefore can be compared with approximations. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 440–447, 2003     

Dynamic Coresets

We give a dynamic data structure that can maintain an ε-coreset of n points, with respect to the extent measure, in O(log n) time per update for any constant ε>0 and any constant dimension. The previous method by Agarwal, Har-Peled, and Varadarajan requires polylogarithmic update time. For points with integer coordinates bounded by U, we alternatively get O(log log U) time. Numerous applications follow, for example, on dynamically approximating the width, smallest enclosing cylinder, minimum bounding box, or minimum-width annulus. We can also use the same approach to maintain approximate k-centers in time O(log n) (or O(log log U) if the spread is bounded by U) for any constant k and any constant dimension. For the smallest enclosing cylinder problem, we also show that a constant-factor approximation can be maintained in O(1) randomized amortized time on the word RAM. This work has been supported by NSERC. A preliminary version of this paper has appeared in Proc. 24th ACM Sympos Comput. Geom., 2008.     

Shear Flows of an Ideal Fluid and Elliptic Equations in Unbounded Domains

We prove that, in a two‐dimensional strip, a steady flow of an ideal incompressible fluid with no stationary point and tangential boundary conditions is a shear flow. The same conclusion holds for a bounded steady flow in a half‐plane. The proofs are based on the study of the geometric properties of the streamlines of the flow and on one‐dimensional symmetry results for solutions of some semilinear elliptic equations. Some related rigidity results of independent interest are also shown in n‐dimensional slabs in any dimension n.© 2016 Wiley Periodicals, Inc.     

A Frequency Function and Singular Set Bounds for Branched Minimal Immersions

We establish a frequency function monotonicity formula for two‐valued C^1,α solutions to the minimal surface system on n‐dimensional domains. We also establish the sharp regularity result that such solutions are of class C^{1, 1/2}, and that their branch sets, if nonempty, have Hausdorff dimension equal to n‐2.© 2016 Wiley Periodicals, Inc.     

Dimension theory of iterated function systems

Let {S_i} be an iterated function system (IFS) on ?^d with attractor K. Let (Σ, σ) denote the one‐sided full shift over the alphabet {1, …, ??}. We define the projection entropy function h_π on the space of invariant measures on Σ associated with the coding map π : Σ → K and develop some basic ergodic properties about it. This concept turns out to be crucial in the study of dimensional properties of invariant measures on K. We show that for any conformal IFS (respectively, the direct product of finitely many conformal IFSs), without any separation condition, the projection of an ergodic measure under π is always exactly dimensional and its Hausdorff dimension can be represented as the ratio of its projection entropy to its Lyapunov exponent (respectively, the linear combination of projection entropies associated with several coding maps). Furthermore, for any conformal IFS and certain affine IFSs, we prove a variational principle between the Hausdorff dimension of the attractors and that of projections of ergodic measures. © 2008 Wiley Periodicals, Inc.     

Efficient algorithms for three‐dimensional axial and planar random assignment problems

Beautiful formulas are known for the expected cost of random two‐dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural “Axial” and “Planar” versions, both of which are NP‐hard. For 3‐dimensional Axial random assignment instances of size n, the cost scales as Ω(1/ n), and a main result of the present paper is a linear‐time algorithm that, with high probability, finds a solution of cost O(n^–1+o(1)). For 3‐dimensional Planar assignment, the lower bound is Ω(n), and we give a new efficient matching‐based algorithm that with high probability returns a solution with cost O(n log n). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 160–196, 2015     

A short proof of the generalized Bonnet theorem

In three‐dimensional Euclidean space E³, the Bonnet theorem says that a curve on a ruled surface in three‐dimensional Euclidean space, having two of the following properties, has also a third one, namely, it can be a geodesic, that it can be the striction line, and that it cuts the generators under constant angle. In this work, in n dimensional Euclidean space Eⁿ, a short proof of the theorem generalized for (k + 1) dimensional ruled surfaces by Hagen in 4 is given. Copyright © 2013 John Wiley & Sons, Ltd.     

An approximation result for free discontinuity functionals by means of non‐local energies

We approximate, in the sense of Γ‐convergence, free discontinuity functionals with linear growth by a sequence of non‐local integral functionals depending on the average of the gradient on small balls. The result extends to a higher dimension what is already proved in (Ann. Mat. Pura Appl. 2007; 186 (4): 722–744), where there is the proof of the general one‐dimensional case, and in (ESAIM Control Optim. Calc. Var. 2007; 13 (1):135–162), where the n‐dimensional case with ?=Id is treated. Moreover, we investigate whether it is possible to approximate a given free discontinuity functional by means of non‐local energies. Copyright © 2008 John Wiley & Sons, Ltd.     

New upper bounds on the decomposability of planar graphs

It is known that a planar graph on n vertices has branch‐width/tree‐width bounded by . In many algorithmic applications, it is useful to have a small bound on the constant α. We give a proof of the best, so far, upper bound for the constant α. In particular, for the case of tree‐width, α < 3.182 and for the case of branch‐width, α < 2.122. Our proof is based on the planar separation theorem of Alon, Seymour, and Thomas and some min–max theorems of Robertson and Seymour from the graph minors series. We also discuss some algorithmic consequences of this result. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Counting lattice chains and Delannoy paths in higher dimensions

Lattice chains and Delannoy paths represent two different ways to progress through a lattice. We use elementary combinatorial arguments to derive new expressions for the number of chains and the number of Delannoy paths in a lattice of arbitrary finite dimension. Specifically, fix nonnegative integers n₁,…,n_d, and let L denote the lattice of points (a₁,…,a_d)∈Z^d that satisfy 0≤a_i≤n_i for 1≤i≤d. We prove that the number of chains in L is given by where . We also show that the number of Delannoy paths in L equals Setting n_i=n (for all i) in these expressions yields a new proof of a recent result of Duchi and Sulanke [9] relating the total number of chains to the central Delannoy numbers. We also give a novel derivation of the generating functions for these numbers in arbitrary dimension.     

Hitting time of large subsets of the hypercube

We study the simple random walk on the n‐dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly rescaled hitting time is asymptotically exponentially distributed, uniformly in the starting position of the walk. These conditions are then verified for percolation clouds with densities that are much smaller than (n log n)^‐1. A main motivation behind this article is the study of the so‐called aging phenomenon in the Random Energy Model, the simplest model of a mean‐field spin glass. Our results allow us to prove aging in the REM for all temperatures, thereby extending earlier results to their optimal temperature domain. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Riemannian Manifold in Which the Skew-Symmetric Curvature Operator has Pointwise Constant Eigenvalues

We study manifolds where the natural skew-symmetric curvature operator has pointwise constant eigenvalues. We give a local classification (up to isometry) of such manifolds in dimension 4. In dimension 3, we describe such manifolds up to a classification of three - dimensional Riemannian manifolds with principal Ricci curvatures r₁ = r₂ = 0, r₃- arbitrary. We give examples of such manifolds in all dimensions which do not have constant sectional curvature; these manifolds are not pointwise Osserman manifolds in general.     

On approximation by projections of polytopes with few facets

We provide an affirmative answer to a problem posed by Barvinok and Veomett in [4], showing that in general an n-dimensional convex body cannot be approximated by a projection of a section of a simplex of subexponential dimension. Moreover, we prove that for all 1 ≤ n ≤ N there exists an n-dimensional convex body B such that for every n-dimensional convex body K obtained as a projection of a section of an N-dimensional simplex one has $$d(B,K) \geqslant c\sqrt {\frac{n}{{\ln \frac{{2N\ln (2N)}}{n}}}} $$ , where d(·, ·) denotes the Banach-Mazur distance and c is an absolute positive constant. The result is sharp up to a logarithmic factor.     

The affine image of a convex body of constant breadth

A convex body is said to have constant diagonal if and only if the main diagonal of the circumscribed boxes has constant length. It is shown that ann-dimensional convex body,n≧3, is the affine image of a body of constant breadth if and only if it has constant diagonal. Affine images of bodies of constant breadth are also characterized by the property that the orthogonal projection on each hyperplane is the affine image of a body of constant breadth in that hyperplane.     

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.     

Confined steady states of a Vlasov‐Poisson plasma in an infinitely long cylinder

We consider the two‐dimensional Vlasov‐Poisson system to model a two‐component plasma whose distribution function is constant with respect to the third space dimension. First, we show how this two‐dimensional Vlasov‐Poisson system can be derived from the full three‐dimensional model. The existence of compactly supported steady states with vanishing electric potential in a three‐dimensional setting has already been investigated in the literature. We show that these results can easily be adapted to the two‐dimensional system. However, our main result is to prove the existence of compactly supported steady states even with a nontrivial self‐consistent electric potential.     

Tractable embeddings of Besov spaces into small Lebesgue spaces

This paper deals with dimension‐controllable (tractable) embeddings of Besov spaces on n‐dimensional torus into small Lebesgue spaces. Our techniques rely on the approximation structure of Besov spaces, extrapolation properties of small Lebesgue spaces and interpolation.     

Embeddings through discrete sets of balls

We investigate whether a Stein manifold M which allows proper holomorphic embedding into ℂ ⁿ can be embedded in such a way that the image contains a given discrete set of points and in addition follow arbitrarily close to prescribed tangent directions in a neighbourhood of the discrete set. The infinitesimal version was proven by Forstnerič to be always possible. We give a general positive answer if the dimension of M is smaller than n/2 and construct counterexamples for all other dimensional relations. The obstruction we use in these examples is a certain hyperbolicity condition.