skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Extremal spectral gaps for periodic Schrödinger operators
The spectrum of a Schrödinger operator with periodic potential generally consists of bands and gaps. In this paper, for fixed m , we consider the problem of maximizing the gap-to-midgap ratio for the m th spectral gap over the class of potentials which have fixed periodicity and are pointwise bounded above and below. We prove that the potential maximizing the m th gap-to-midgap ratio exists. In one dimension, we prove that the optimal potential attains the pointwise bounds almost everywhere in the domain and is a step-function attaining the imposed minimum and maximum values on exactly m intervals. Optimal potentials are computed numerically using a rearrangement algorithm and are observed to be periodic. In two dimensions, we develop an efficient rearrangement method for this problem based on a semi-definite formulation and apply it to study properties of extremal potentials. We show that, provided a geometric assumption about the maximizer holds, a lattice of disks maximizes the first gap-to-midgap ratio in the infinite contrast limit. Using an explicit parametrization of two-dimensional Bravais lattices, we also consider how the optimal value varies over all equal-volume lattices.  more » « less
Award ID(s):
1818948
PAR ID:
10163962
Author(s) / Creator(s):
;
Date Published:
Journal Name:
ESAIM: Control, Optimisation and Calculus of Variations
Volume:
25
ISSN:
1292-8119
Page Range / eLocation ID:
40
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Communications in Mathematical Physics)
    We consider discrete periodic operator on Z^d with respect to lattices of full rank. We describe the class of lattices for which the operator may have a spectral gap for arbitrarily small potentials. We also show that, for a large class of lattices, the dimensions of the level sets of spectral band functions at the band edges do not exceed d-2. 
    more » « less
  2. ; ; (, Communications on Pure and Applied Mathematics)
    Abstract The free boundary problem for a two‐dimensional fluid permeating a porous medium is studied. This is known as the one‐phase Muskat problem and is mathematically equivalent to the vertical Hele‐Shaw problem driven by gravity force. We prove that if the initial free boundary is the graph of a periodic Lipschitz function, then there exists a global‐in‐time Lipschitz solution in the strong sense and it is the unique viscosity solution. The proof requires quantitative estimates for layer potentials and pointwise elliptic regularity in Lipschitz domains. This is the first construction of unique global strong solutions for the Muskat problem with initial data of arbitrary size. 
    more » « less
  3. ; ; ; (, The Journal of the Acoustical Society of America)
    A spatially periodic structure of heterogeneous elastic rods that periodically oscillate along their axes is proposed as a time-modulated phononic crystal. Each rod is a bi-material cylinder, consisting of periodically distributed slices with significantly different elastic properties. The rods are imbedded in an elastic matrix. Using a plane wave expansion, it is shown that the dispersion equation for sound waves is obtained from the solutions of a quadratic eigenvalue problem over the eigenfrequency ω. The coefficients of the corresponding quadratic polynomial are represented by infinite matrices defined in the space spanned by the reciprocal lattice vectors, where elements depend on the velocity of translation motion of the rods and Bloch vector k. The calculated band structure exhibits both ω and k bandgaps. If a frequency gap overlaps with a momentum gap, a mixed gap is formed. Within a mixed gap, ω and k acquire imaginary parts. A method of analysis of the dispersion equation in complex ω−k space is proposed. As a result of the high elastic contrast between the materials in the bi-material rods, a substantial depth of modulation is achieved, leading to a large gap to midgap ratio for the frequency, momentum, and mixed bandgaps. 
    more » « less
  4. ; ; (, Leibniz international proceedings in informatics)
    Motivated by the use of high speed circuit switches in large scale data centers, we consider the problem of circuit switch scheduling. In this problem we are given demands between pairs of servers and the goal is to schedule at every time step a matching between the servers while maximizing the total satisfied demand over time. The crux of this scheduling problem is that once one shifts from one matching to a different one a fixed delay delta is incurred during which no data can be transmitted. For the offline version of the problem we present a (1-(1/e)-epsilon) approximation ratio (for any constant epsilon >0). Since the natural linear programming relaxation for the problem has an unbounded integrality gap, we adopt a hybrid approach that combines the combinatorial greedy with randomized rounding of a different suitable linear program. For the online version of the problem we present a (bi-criteria) ((e-1)/(2e-1)-epsilon)-competitive ratio (for any constant epsilon >0 ) that exceeds time by an additive factor of O(delta/epsilon). We note that no uni-criteria online algorithm is possible. Surprisingly, we obtain the result by reducing the online version to the offline one. 
    more » « less
  5. (, The International Journal of Robotics Research)
    We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable dimensions in a time-optimal manner. We systematically analyze the intrinsic optimality structure, which is fairly rich and intriguing, under different levels of item distinguishability (fully-labeled, where each item has a unique label, or partially-labeled, where multiple items may be of the same type) and different lattice dimensions. Focusing on the most practical setting of one and two dimensions, we develop low polynomial time cycle-following-based algorithms that optimally perform rearrangements on 1D lattices under both fully- and partially-labeled settings. On the other hand, we show that rearrangement on 2D and higher-dimensional lattices become computationally intractable to optimally solve. Despite their NP-hardness, we prove that efficient cycle-following-based algorithms remain optimal in the asymptotic sense for 2D fully- and partially-labeled settings, in expectation, using the interesting fact that random permutations induce only a small number of cycles. We further improve these algorithms to provide 1. x-optimality when the number of items is small. Simulation studies corroborate the effectiveness of our algorithms. The implementation of the algorithms from the paper can be found at github.com/arc-l/lattice-rearrangement. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email