On the partial differential equations of electrostatic MEMS devices III: Refined touchdown behavior

This paper is a continuation of [N. Ghoussoub, Y. Guo, On the partial differential equations of electrostatic MEMS devices: Stationary case, SIAM J. Math. Anal. 38 (2007) 1423-1449] and [N. Ghoussoub, Y. Guo, On the partial differential equations of electrostatic MEMS devices II: Dynamic case, NoDEA Nonlinear Differential Equations Appl. (2008), in press], where we analyzed nonlinear parabolic problem on a bounded domain Ω of RN with Dirichlet boundary conditions. This equation models a simple electrostatic Micro-Electromechanical System (MEMS) device consisting of a thin dielectric elastic membrane with boundary supported at 0 above a rigid ground plate located at −1. Here u is modeled to describe dynamic deflection of the elastic membrane. When a voltage—represented here by λ—is applied, the membrane deflects towards the ground plate and a snap-through (touchdown) must occur when it exceeds a certain critical value λ^∗ (pull-in voltage), creating a so-called “pull-in instability” which greatly affects the design of many devices. In an effort to achieve better MEMS design, the material properties of the membrane can be technologically fabricated with a spatially varying dielectric permittivity profile f(x). In this work, some a priori estimates of touchdown behavior are established, based on which the refined touchdown profiles are obtained by adapting self-similar method and center manifold analysis. Applying various analytical and numerical techniques, some properties of touchdown set—such as compactness, location and shape—are also discussed for different classes of varying permittivity profiles.     

Palindromic companion forms for matrix polynomials of odd degree

The standard way to solve polynomial eigenvalue problems P(λ)x=0 is to convert the matrix polynomial P(λ) into a matrix pencil that preserves its spectral information — a process known as linearization. When P(λ) is palindromic, the eigenvalues, elementary divisors, and minimal indices of P(λ) have certain symmetries that can be lost when using the classical first and second Frobenius companion linearizations for numerical computations, since these linearizations do not preserve the palindromic structure. Recently new families of pencils have been introduced with the goal of finding linearizations that retain whatever structure the original P(λ) might possess, with particular attention to the preservation of palindromic structure. However, no general construction of palindromic linearizations valid for all palindromic polynomials has as yet been achieved. In this paper we present a family of linearizations for odd degree polynomials P(λ) which are palindromic whenever P(λ) is, and which are valid for all palindromic polynomials of odd degree. We illustrate our construction with several examples. In addition, we establish a simple way to recover the minimal indices of the polynomial from those of the linearizations in the new family.     

Chain sequences and symmetric generalized orthogonal polynomials

In this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K_n^(λ,M,k) associated with the probability measure dφ(λ,M,k;x), which is the Gegenbauer measure of parameter λ+1 with two additional mass points at ±k. When k=1 we obtain information on the polynomials K_n^(λ,M) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K_n^(λ,M,k) in relation to M and k are also given.     

Anderson localization for the discrete one-dimensional quasi-periodic Schrödinger operator with potential defined by a Gevrey-class function

In this paper we consider the discrete one-dimensional Schrödinger operator with quasi-periodic potential v_n=λv(x+nω). We assume that the frequency ω satisfies a strong Diophantine condition and that the function v belongs to a Gevrey class, and it satisfies a transversality condition. Under these assumptions we prove—in the perturbative regime—that for large disorder λ and for most frequencies ω the operator satisfies Anderson localization. Moreover, we show that the associated Lyapunov exponent is positive for all energies, and that the Lyapunov exponent and the integrated density of states are continuous functions with a certain modulus of continuity. We also prove a partial nonperturbative result assuming that the function v belongs to some particular Gevrey classes.     

Decomposition of balanced complete bipartite multigraphs into multistars

In this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete bipartite multigraph λK_n,n into (not necessarily isomorphic) multistars with the same number of edges. We also give a necessary and sufficient condition of decomposing 2K_n,n into isomorphic multistars.     

On uniqueness of characteristic classes

We give an axiomatic characterization of maps from algebraic K-theory. The results apply to a large class of maps from algebraic K-theory to any suitable cohomology theory or to algebraic K-theory. In particular, we obtain comparison theorems for the Chern character and Chern classes and for the Adams operations and λ-operations on higher algebraic K-theory. We show that the Adams operations and λ-operations defined by Grayson agree with the ones defined by Gillet and Soulé.     

Ginzburg-Landau minimizers with prescribed degrees. Capacity of the domain and emergence of vortices

Let Ω⊂R² be a simply connected domain, let ω be a simply connected subdomain of Ω, and set A=Ω?ω. Suppose that J is the class of complex-valued maps on the annular domain A with degree 1 both on ∂Ω and on ∂ω. We consider the variational problem for the Ginzburg-Landau energy Eλ among all maps in J. Because only the degree of the map is prescribed on the boundary, the set J is not necessarily closed under a weak H¹-convergence. We show that the attainability of the minimum of Eλ over J is determined by the value of cap(A)—the H¹-capacity of the domain A. In contrast, it is known, that the existence of minimizers of Eλ among the maps with a prescribed Dirichlet boundary data does not depend on this geometric characteristic. When cap(A)?π (A is either subcritical or critical), we show that the global minimizers of Eλ exist for each λ>0 and they are vortexless when λ is large. Assuming that λ→∞, we demonstrate that the minimizers of Eλ converge in H¹(A) to an S¹-valued harmonic map which we explicitly identify. When cap(A)<π (A is supercritical), we prove that either (i) there is a critical value λ₀ such that the global minimizers exist when λ<λ₀ and they do not exist when λ>λ₀, or (ii) the global minimizers exist for each λ>0. We conjecture that the second case never occurs. Further, for large λ, we establish that the minimizing sequences/minimizers in supercritical domains develop exactly two vortices—a vortex of degree 1 near ∂Ω and a vortex of degree −1 near ∂ω.     

Mono-multi bipartite Ramsey numbers, designs, and matrices

Eroh and Oellermann defined BRR(G₁,G₂) as the smallest N such that any edge coloring of the complete bipartite graph K_N,N contains either a monochromatic G₁ or a multicolored G₂. We restate the problem of determining BRR(K_1,λ,K_r,s) in matrix form and prove estimates and exact values for several choices of the parameters. Our general bound uses Füredi's result on fractional matchings of uniform hypergraphs and we show that it is sharp if certain block designs exist. We obtain two sharp results for the case r=s=2: we prove BRR(K_1,λ,K_2,2)=3λ-2 and that the smallest n for which any edge coloring of K_λ,n contains either a monochromatic K_1,λ or a multicolored K_2,2 is λ².     

Balanced path decomposition of λ K n,n and λ K n,n *

Let P _k denote a path with k edges and λ K _n,n denote the λ-fold complete bipartite graph with both parts of size n. In this paper, we obtain the necessary and sufficient conditions for λ K _n,n to have a balanced P _k -decomposition. We also obtain the directed version of this result.     

Commutation in vector spaces over division rings with a conjugation

We analyze some commutation properties of the sets of mappings of a vector space X over a division ring K with a conjugation j which are relevant when studying symmetries in quantum mechanics and in elementary-particle physics. The first part of the paper is devoted to the “linear-antilinear centralizer” $\text{U}$^c, i.e. to the group of the linear and antilinear (j-semilinear) invertible mappings which commute with a given set $\text{U}$ of mappings of X. Some nontrivial results which connect properties of $\text{U}$ with properties of $\text{U}$^c are obtained, and a classification of the sets of mappings of X is found by means of purely algebraic techniques. This classification is more detailed than that usually adopted by physicists. The second part of the paper is devoted to the ?-linear commutant $\text{U}$′^λ, i.e. to the set of mappings of X which commute with $\text{U}$ and which are linear with respect to the j-invariant subring ? of K. We investigate the structure of $\text{U}$′^λ in connection with the structure and some of the properties of $\text{U}$. In the third part, we show how the results obtained in the preceding sections simplify when the division ring K is of type II (according to a classification introduced in an earlier work). Finally, we illustrate with simple examples in one- and two-dimensional vector spaces all the cases which can occur.     

Numerical analysis of generalised max-plus eigenvalue problems

This paper is concerned with the deterministic discrete-time infinite horizon optimisation problem on a compact metric space with an average cost criterion involving two functions K (the “cost”) and T (the “time”). Firstly, we collect the different characterisations of the value λ in terms of generalised max-plus eigenvalue problem and in terms of linear programming. Secondly, we prove an error bound on λ when the space is discretised.     

Polynomial basis for the irreducible representations of U6 in the chain U6 ⊃ R6

Explicit polynomial basis for the Irreducible Representation (IR) (K₁, K₂, K₃) of U₆ containing an IR (λ₁, λ₂, λ₃) of R₆ is obtained. These polynomials are useful in calculating the nuclear energy levels in the2s? 1d shell.     

Solutions to an inverse monic quadratic eigenvalue problem

Given n+1 pairs of complex numbers and vectors (closed under complex conjugation), the inverse quadratic eigenvalue problem is to construct real symmetric or anti-symmetric matrix C and real symmetric matrix K of size n×n so that the quadratic pencil Q(λ)=λ²I_n+λC+K has the given n+1 pairs as eigenpairs. Necessary and sufficient conditions under which this quadratic inverse eigenvalue problem is solvable are obtained. Numerical algorithms for solving the problem are developed. Numerical examples illustrating these solutions are presented.     

Decomposition of complete multigraphs into crown graphs

Let λ K _v be the complete multigraph, G a finite simple graph. A G-design of λ K _v is denoted by GD(v,G,λ). The crown graph Q _n is obtained by joining single pendant edge to each vertex of an n-cycle. We give new constructions for Q _n -designs. Let v and λ be two positive integers. For n=4, 6, 8 and λ≥1, there exists a GD(v,Q _n ,λ) if and only if either (1) v>2n and λ v(v?1)≡0 (mod 4n), or (2) v=2n and λ≡0 (mod 4). Let n≥4 be even. Then (1) there exists a GD(2n,Q _n ,λ) if and only if λ≡0 (mod 4). (2) There exists a GD(2n+1,Q _n ,λ) when λ≡0 (mod 4).     

Symmetry and bifurcation near families of solutions

Let X, Z and Λ be Banach spaces, M: X × Λ → Z a C¹-function, and assume that the equation M(x, λ) = 0 has a family of solutions for λ = 0. In this paper we consider the bifurcation of solutions from this family, for ¦λ¦ small, under the condition that both the unperturbed (λ = 0) and the perturbed (λ ≠ 0) equations have certain symmetry properties. The problem is reduced by the Liapunov-Schmidt method, and the bifurcation equations are solved by a straightforward use of the symmetry. As an application we obtain existence of certain periodic solutions for the undamped Duffing equation, a result recently obtained by Schmitt and Mazzanti using different methods.     

Nonlinear eigenvalue problems with positively convex operators

We consider the equation u = λAu (λ > 0), where A is a forced isotone positively convex operator in a partially ordered normed space with a complete positive cone K. Let Λ be the set of positive λ for which the equation has a solution u?K, and let Λ₀ be the set of positive λ for which a positive solution—necessarily the minimum one—can be obtained by an iteration u_n = λAu_n?1, u₀ = 0. We show that if K is normal, and if Λ is nonempty, then Λ₀ is nonempty, and each set Λ₀, Λ is an interval with $\text{inf}\text{(Λ}{}_0\text{) =}\text{inf}\text{(Λ) = 0}\text{and sup}\text{(Λ}{}_0\text{) =}\text{sup}\text{(Λ) (= λ1,}\text{say}\text{)}$; but we may have λ1 ? Λ₀ and λ1 ? Λ. Furthermore, if A is bounded on the intersection of K with a neighborhood of 0, then Λ₀ is nonempty. Let u⁰(λ) = lim_n→∞(λA)ⁿ(0) be the minimum positive fixed point corresponding to λ ? Λ₀. Then u⁰(λ) is a continuous isotone convex function of λ on Λ₀.     

Kostka functions associated to complex reflection groups and a conjecture of Finkelberg-Ionov

Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov(2016) defined alternate functions K_(λ,μ)(t) by using an analogue of Lusztig's partition function, and showed that K_(λ,μ)(t) ∈Z≥0[t] for generic μ by making use of a coherent realization. They conjectured that K_(λ,μ)(t) coincide with K_(λ,μ)~-(t). In this paper, we show that their conjecture holds. We also discuss the multi-variable version, namely, r-variable Kostka functions K_(λ,μ)~±(t_1,…,t_r).     

The functional equation P(f)=Q(g) in a p-adic field

Let K be a complete ultrametric algebraically closed field of characteristic π. Let P,Q be in K[x] with P′Q′ not identically 0. Consider two different functions f,g analytic or meromorphic inside a disk |x−a|<r (resp. in all K), satisfying P(f)=Q(g). By applying the Nevanlinna's values distribution Theory in characteristic π, we give sufficient conditions on the zeros of P′,Q′ to assure that both f,g are “bounded” in the disk (resp. are constant). If π≠2 and deg(P)=4, we examine the particular case when Q=λP (λ∈K) and we derive several sets of conditions characterizing the existence of two distinct functions f,g meromorphic in K such that P(f)=λP(g).     

On some stochastic coalescents

We consider infinite systems of macroscopic particles characterized by their masses. Each pair of particles with masses x and y coalesce at a given rate K(x, y). We assume that K satisfies a sort of Hölder property with index λ ∈ (0,1], and that the initial condition admits a moment of order λ. We show the existence of such infinite particle systems, as strong Markov processes enjoying a Feller property. We also show that the obtained processes are the only possible limits when making the number of particles tend to infinity in a sequence of finite particle systems with the same dynamics.     

Combinatorial structures in loops I. Elements of the decomposition theory

Difference sets have been extensively studied in groups, principally in Abelian groups. Here we extend the notion of a difference set to loops. This entails considering the class of 〈υ, k〉 systems and the special subclasses of 〈υ, k, λ〉 principal block partial designs (PBPDs) and 〈υ, k, λ〉 designs. By means of a certain permutation matrix decomposition of the incidence matrices of a system and its complement, we can isomorphically identify an abstract 〈υ, k〉 system with a corresponding system in a loop. Special properties of this decomposition correspond to special algebraic properties of the loop. Here we investigate the situation when some or all of the elements of the loop are right inversive. We identify certain classes of 〈υ, k, λ〉 designs, including skew-Hadamard designs and finite projective planes, with designs and difference sets in right inverse property loops and prove a universal existence theorem for 〈υ, k, λ〉 PBPDs and corresponding difference sets in such loops.