Bounding the Roots of Ideal and Open Set Polynomials

Let P be a preorder (i.e., reflexive, transitive relation) on a finite set X. The ideal polynomial of P is the function where d_k is the number of ideals (i.e. downwards closed sets) of cardinality k in P. We provide upper bounds for the moduli of the roots of ideal_P(x) in terms of the width of P. We also provide examples of preorders with roots of large moduli. The results have direct applications to the generating polynomials counting open sets in finite topologies. Received December 15, 2004     

Spectral decomposition and Gelfand’s theorem

We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set $\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\}We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set s(A)={il_k;k ? \mathbb\mathbbZ^*}\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\} is discrete and satisfies ?\frac1|l_k|^ld_kⁿ < ￥\sum \frac{1}{|\lambda_{k}|^{\ell}\delta_{k}^{n}}<\infty , where ℓ is a nonnegative integer and d_k=min(\frac|l_k+1-l_k|2,\frac|l_k-1-l_k|2)\delta _{k}=\min(\frac{|\lambda_{k+1}-\lambda _{k}|}{2},\frac{|\lambda _{k-1}-\lambda _{k}|}{2}) . In this case, Theorem 3, we show by using Gelfand’s Theorem that there exists a family of projectors (P_k)_{k ? \mathbb\mathbbZ^*}(P_{k})_{k\in\mathbb{\mathbb{Z}}^{*}} such that, for any x∈D(A ^n+ℓ ), the decomposition ∑P _k x=x holds.     

Schrödinger Operators on Zigzag Nanotubes

We consider the Schr?dinger operator with a periodic potential on quasi-1D models of zigzag single-wall carbon nanotubes. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite multiplicity. We describe all compactly supported eigenfunctions with the same eigenvalue. We define a Lyapunov function, which is analytic on some Riemann surface. On each sheet, the Lyapunov function has the same properties as in the scalar case, but it has branch points, which we call resonances. We prove that all resonances are real. We determine the asymptotics of the periodic and antiperiodic spectrum and of the resonances at high energy. We show that there exist two types of gaps: i) stable gaps, where the endpoints are periodic and anti-periodic eigenvalues, ii) unstable (resonance) gaps, where the endpoints are resonances (i.e., real branch points of the Lyapunov function). We describe all finite gap potentials. We show that the mapping: potential all eigenvalues is a real analytic isomorphism for some class of potentials. Submitted: October 5, 2006. Accepted: December 15, 2006.     

Resonance phenomena in infinite strings with periodic ends

We study the propagation of linear waves, generated by a compactly supported time-harmonic force distribution, in an infinite string under the assumption that the material properties are p₁-periodic for x > a and p₂-periodic for x < ? a. As has been pointed out in two preceding papers devoted to related configurations ([4], [5]), the combination of a time-periodic force and a periodic spatial structure may lead to resonance phenomena. We show that the present configuration also permits resonances of orders t and t^1/2 for a discrete set of frequencies. The occurrence of resonances is closely related to the presence of non-trivial solutions of the corresponding time-independent homogeneous problem which satisfy certain asymptotic properties (‘standing waves’).     

Monotonically Computable Real Numbers

Area number x is called k‐monotonically computable (k‐mc), for constant k > 0, if there is a computable sequence (x_n)_{n ∈ ℕ} of rational numbers which converges to x such that the convergence is k‐monotonic in the sense that k · |x — x_n| ≥ |x — x_m| for any m > n and x is monotonically computable (mc) if it is k‐mc for some k > 0. x is weakly computable if there is a computable sequence (x_s)_{s ∈ ℕ} of rational numbers converging to x such that the sum $\sum _{s \in \mathbb{N}}$|x_s — x_{s + 1}| is finite. In this paper we show that a mc real numbers are weakly computable but the converse fails. Furthermore, we show also an infinite hierarchy of mc real numbers.     

The Partitioned Version of the Erdős—Szekeres Theorem

   Abstract. Let k≥ 4 . A finite planar point set X is called a convex k -clustering if it is a disjoint union of k sets X ₁ , . . . ,X _k of equal sizes such that x ₁ x ₂ . . . x _k is a convex k -gon for each choice of x ₁ ∈ X ₁ , . . . ,x _k ∈ X _k . Answering a question of Gil Kalai, we show that for every k≥ 4 there are two constants c=c(k) , c'=c'(k) such that the following holds. If X is a finite set of points in general position in the plane, then it has a subset X' of size at most c' such that X \ X' can be partitioned into at most c convex k -clusterings. The special case k=4 was proved earlier by Pór. Our result strengthens the so-called positive fraction Erdos—Szekeres theorem proved by Barany and Valtr. The proof gives reasonable estimates on c and c' , and it works also in higher dimensions. We also improve the previous constants for the positive fraction Erdos—Szekeres theorem obtained by Pach and Solymosi.     

Reality properties of conjugacy classes in<Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>

LetG be an algebraic group over a fieldk. We callg εG(k) real ifg is conjugate tog ⁻¹ inG(k). In this paper we study reality for groups of typeG ₂ over fields of characteristic different from 2. LetG be such a group overk. We discuss reality for both semisimple and unipotent elements. We show that a semisimple element inG(k) is real if and only if it is a product of two involutions inG(k). Every unipotent element inG(k) is a product of two involutions inG(k). We discuss reality forG ₂ over special fields and construct examples to show that reality fails for semisimple elements inG ₂ over ℚ and ℚ_p. We show that semisimple elements are real forG ₂ overk withcd(k) ≤ 1. We conclude with examples of nonreal elements inG ₂ overk finite, with characteristick not 2 or 3, which are not semisimple or unipotent.     

Resonances for perturbations of a semiclassical periodic Schrödinger operator

In the semi-classical regime we study the resonances of the operatorP _t =h ²Δ+V+t·δV in some small neighborhood of the first spectral band ofP ₀. HereV is a periodic potential, δV a compactly supported potential andt a small coupling constant. We construct a meromorphic multivalued continuation of the resolvent ofP _t , and define the resonances to be the poles of this continuation. We compute these resonances and study the way they turn into eigenvalues whent crosses a certain threshold.     

An asymptotic version of a conjecture by Enomoto and Ota

In 2000, Enomoto and Ota [J Graph Theory 34 (2000), 163–169] stated the following conjecture. Let G be a graph of order n, and let n₁, n₂, …, n_k be positive integers with \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} {{n}}_{{{i}}} = {{n}}\end{eqnarray*}. If σ₂(G)≥n+ k?1, then for any k distinct vertices x₁, x₂, …, x_k in G, there exist vertex disjoint paths P₁, P₂, …, P_k such that |P_i|=n_i and x_i is an endpoint of P_i for every i, 1≤i≤k. We prove an asymptotic version of this conjecture in the following sense. For every k positive real numbers γ₁, …, γ_k with \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} \gamma_{{{i}}} = {{1}}\end{eqnarray*}, and for every ε>0, there exists n₀ such that for every graph G of order n≥n₀ with σ₂(G)≥n+ k?1, and for every choice of k vertices x₁, …, x_k∈V(G), there exist vertex disjoint paths P₁, …, P_k in G such that \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} |{{P}}_{{{i}}}| = {{n}}\end{eqnarray*}, the vertex x_i is an endpoint of the path P_i, and (γ_i?ε)n<|P_i|<(γ_i + ε)n for every i, 1≤i≤k. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 37–51, 2010     

Greedy linear extensions for minimizing bumps

Let P be a finite poset and let L={x ₁<...n} be a linear extension of P. A bump in L is an ordered pair (x _i , x _i+1) where x _ii+1 in P. The bump number of P is the least integer b(P), such that there exists a linear extension of P with b(P) bumps. We call L optimal if the number of bumps of L is b(P). We call L greedy if x _{i j} for every j>i, whenever (x _i, x _i+1) is a bump. A poset P is called greedy if every greedy linear extension of P is optimal. Our main result is that in a greedy poset every optimal linear extension is greedy. As a consequence, we prove that every greedy poset of bump number k is the linear sum of k+1 greedy posets, each of bump number zero.This research (Math/1406/31) was supported by the Research Center, College of Science, King Saud University, Riyadh, Saudi Arabia.     

On a function associated with the Bessel functions

Summary Defining the function Δn, 1,k;x(J) asΔn, 1,k;x(J)=J _n+1(x)−J _n(x)J _n+k+1(x) associated with the Bessel functionJ _n(x), we derive a series of products of Bessel functions for Δ_{n, f, k, x} (J). Whenk=1,k;x (J) becomes Turàn expression for Bessel functions. Some consequences have been pointed out.

---

Riassunto Definita la Δ_{n, f, k, x} (J) come Δ_{n, f, k, x}, (J)=J _n+1(x)J _n+k(x)-J _n(_n+k+1)(x) associata alla funzioneJ _n(x) di Bessel, si ricava una serie di prodotti di funzioni di Bessel per Δ_{n, f, k, x}, (J). 3 Quandok=1, Δ_{n, f, k, x}, (J) diventa una espressione di Turàn per le funzioni di 2 Bessel, vengono inoltre indicate alcune altre conseguenze.

     

A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality

In this paper, we study the link between a Chance-Constrained optimization Problem (CCP) and its sample counterpart (SP). SP has a finite number, say N, of sampled constraints. Further, some of these sampled constraints, say k, are discarded, and the final solution is indicated by x^*_N,kx^{\ast}_{N,k}. Extending previous results on the feasibility of sample convex optimization programs, we establish the feasibility of x^*_N,kx^{\ast}_{N,k} for the initial CCP problem.     

The Spectrum of a Periodic Complex Jacobi Matrix Revisited

Let G be a complex periodic Jacobi matrix of period k. We reduce the study of the spectrum of G to that of a block tridiagonal matrix of the form [formula] where I_k and O_k denote the identity and null matrices of order k, respectively.     

A sufficient condition for graphs to be weaklyk-linked

We consider graphs, which are finite, undirected, without loops and in which multiple edges are possible. For each natural numberk letg(k) be the smallest natural numbern, so that the following holds:LetG be ann-edge-connected graph and lets ₁,...,s _k,t ₁,...,t _k be vertices ofG. Then for everyi {1,..., k} there existsa pathP _i froms _i tot _i, so thatP ₁,...,P _k are pairwise edge-disjoint. We prove      

Fractional dimension of partial orders

Given a partially ordered setP=(X, ), a collection of linear extensions {L ₁,L ₂,...,L _r } is arealizer if, for every incomparable pair of elementsx andy, we havex<y in someL _i (andy<x in someL _j ). For a positive integerk, we call a multiset {L ₁,L ₂,...,L _t } ak-fold realizer if for every incomparable pairx andy we havex<y in at leastk of theL _i 's. Lett(k) be the size of a smallestk-fold realizer ofP; we define thefractional dimension ofP, denoted fdim(P), to be the limit oft(k)/k ask. We prove various results about the fractional dimension of a poset.Research supported in part by the Office of Naval Research.     

A computer-assisted proof for photonic band gaps

We investigate photonic crystals, modeled by a spectral problem for Maxwell’s equations with periodic electric permittivity. Here, we specialize to a two-dimensional situation and to polarized waves. By Floquet–Bloch theory, the spectrum has band-gap structure, and the bands are characterized by families of eigenvalue problems on a periodicity cell, depending on a parameter k varying in the Brillouin zone K. We propose a computer-assisted method for proving the presence of band gaps: For k in a finite grid in K, we obtain eigenvalue enclosures by variational methods supported by finite element computations, and then capture all k ∈ K by a perturbation argument.     

Connectivity keeping paths in k‐connected graphs

A result of G. Chartrand, A. Kaugars, and D. R. Lick [Proc Amer Math Soc 32 (1972), 63–68] says that every finite, k‐connected graph G of minimum degree at least ?3k/2? contains a vertex x such that G?x is still k‐connected. We generalize this result by proving that every finite, k‐connected graph G of minimum degree at least ?3k/2?+m?1 for a positive integer m contains a path P of length m?1 such that G?V(P) is still k‐connected. This has been conjectured in a weaker form by S. Fujita and K. Kawarabayashi [J Combin Theory Ser B 98 (2008), 805–811]. © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 61–69, 2010.     

Convergence in finite precision of successive iteration methods under high nonnormality

This paper is devoted to the analysis of the behaviour, in finite precision arithmetic, of the successive iteration method (SI)x ₀,x _k+1 =Ax _k +b,k ≥ 0 whereA is a real or complex matrix of ordern andx is a real or complex vector of sizen. In exact arithmetic, the behaviour of (SI) is completely understood; there is convergence for anyx ₀ if and only if ρ(A) < 1 where ρ(A) is the spectral radius ofA. When (SI) is run on a computer with finite precision arithmetic, then for certain matricesA, the convergence is not guaranteed in practice when ρ(A) < 1 is true in exact arithmetic. It is clear that the phenomenon should be attributed to the conjunction of two factors :i) the nonnormality ofA andii) the finite precision of the computer arithmetic. We perform a straightforward analysis of the convergence of (SI) in finite precision from which we try to understand the subtle interplay between factorsi) andii) which takes place inside the computer, when the iteration matrixA has a high nonnormality. Why should nonnormality be an issue in finite precision? Because only nonnormal matrices can display a significant amount of spectral instability. Therefore a small perturbation ΔA onA can result in a large perturbation of the spectrum. When the spectral instability ofA is high, it appears that a convergence condition such as ρ(A) < 1 may not be generic enough for finite precision computations.     

Resonant destabilization of a floating homogeneous ice layer

We show that a homogeneous elastic ice layer of finite thickness and infinite horizontal extension floating on the surface of a homogeneous water layer of finite depth possesses a countable unbounded set of of resonant frequencies. The water is assumed to be compressible, the viscous effects are neglected in the model. Responses of this water-ice system to spatially localized harmonic in time perturbations with the resonant frequencies grow at least as ?t\sqrt{t} in the two-dimensional (2-D) case and at least as lnt in the three-dimensional (3-D) case, when time t?￥.t\to\infty. The analysis is based on treating the 3-D linear stability problem by applying the Laplace-Fourier transform and reducing the consideration to the 2-D case. The dispersion relation for the 2-D problem D(k,w) = 0,{D}(k,\omega) = 0, obtained previously by Brevdo and Il'ichev [10], is treated analytically and also computed numerically. Here k is a wavenumber, and w\omega is a frequency. It is proved that the system D(k,w) = 0, D_k(k,w) = 0{D}(k,\omega) = 0, {D}_k(k,\omega) = 0 possesses a countable unbounded set of roots (k, w) = (0,w_n), n ? \Bbb Z(k, \omega) = (0,\omega_n), n\in\Bbb Z with Im w_n = 0.\rm{Im}\ \omega_n = 0. Then the analysis of Brevdo [6], [7], [8], [9], which showed the existence of resonances in a homogeneous elastic waveguide, is applied to show that similar resonances exist in the present water-ice model. We propose a resonant mechanism for ice-breaking. It is based on destabilizing the floating ice layer by applying localized harmonic perturbations, with a moderate amplitude and at a resonant frequency.