English
Related papers

Related papers: Upper bound of a band complex

200 papers

We study the vibrational spectrum of a constrained classical ring. Due to the presence of 2-order exceptional points, a topologically trivial band at the infinity can make the vibrational band topologically nontrivial. The symmetry, which…

Mesoscale and Nanoscale Physics · Physics 2021-11-23 Ye Xiong

We prove a rigorous upper bound for the effective conductivity of an isotropic composite made of several isotropic components in any dimension. This upper bound coincides with the Hashin Shtrikman bound when the volume ratio of all phases…

Analysis of PDEs · Mathematics 2010-10-13 Luis Silvestre

Recently, level crossings in the energy bands of crystals have been identified as a key signature for topological phase transitions. Using realistic models we show that the parameter space controlling the occurrence of level coincidences in…

Mesoscale and Nanoscale Physics · Physics 2012-11-19 R. Winkler , L. Y. Wang , Y. H. Lin , C. S. Chu

For a simple-root $\lambda$-constacyclic code $\mathcal{C}$ over $\mathbb{F}_q$, let $\langle\rho\rangle$ and $\langle\rho,M\rangle$ be the subgroups of the automorphism group of $\mathcal{C}$ generated by the cyclic shift $\rho$, and by…

Information Theory · Computer Science 2023-05-12 Hanglong Zhang , Xiwang Cao

Electronic band structure for electrons bound on periodic minimal surfaces is differential-geometrically formulated and numerically calculated. We focus on minimal surfaces because they are not only mathematically elegant (with the surface…

Materials Science · Physics 2009-11-07 H. Aoki , M. Koshino , D. Takeda , H. Morise

We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…

Number Theory · Mathematics 2007-05-23 William D. Banks , Derrick N. Hart , Mayumi Sakata

This article is devoted to the study of the so-called incompressible limit for solutions of the compressible liquid crystals system. We consider the problem in the whole space $\mathbb{R}^{\mathbb{N}}$ and a bounded domain of…

Analysis of PDEs · Mathematics 2013-05-30 Yihang Hao , Xian-gao Liu

Given a sample from some unknown continuous density $f:\mathbb{R}\to\mathbb{R}$, we construct adaptive confidence bands that are honest for all densities in a "generic" subset of the union of $t$-H\"older balls, $0<t\le r$, where $r$ is a…

Statistics Theory · Mathematics 2010-02-26 Evarist Giné , Richard Nickl

For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.

Spectral Theory · Mathematics 2007-05-23 J. Sjoestrand , M. Zworski

Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…

Data Structures and Algorithms · Computer Science 2019-03-01 Peyman Afshani , Casper Benjamin Freksen , Lior Kamma , Kasper Green Larsen

We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest…

Combinatorics · Mathematics 2024-04-18 Haley Broadus , Elena Pavelescu

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

Combinatorics · Mathematics 2012-01-17 Greta Panova

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…

Geometric Topology · Mathematics 2017-02-06 Yago Antolín , Mahan Mj , Alessandro Sisto , Samuel J. Taylor

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

Computational Geometry · Computer Science 2015-09-09 Prosenjit Bose , Dana Jansens , André van Renssen , Maria Saumell , Sander Verdonschot

The spectrum of excitations a two-dimensional, planar honeycomb lattice of two-level atoms coupled by the in-plane electromagnetic field may exhibit band gaps that can be opened either by applying an external magnetic field or by breaking…

Quantum Physics · Physics 2024-03-27 Pierre Wulles , Sergey E. Skipetrov

A flat band is nondispersive and formed under destructive interference. Although flat bands are found in various Hermitian systems, to realize a flat band in non-Hermitian systems is an interesting task. Here, we propose a flat band in a…

Quantum Physics · Physics 2019-03-07 L. Jin

The topological classification of gapped band structures depends on the particular definition of topological equivalence. For translation-invariant systems, stable equivalence is defined by a lack of restrictions on the numbers of occupied…

Mesoscale and Nanoscale Physics · Physics 2024-01-29 Piet W. Brouwer , Vatsal Dwivedi

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Nik Ruškuc

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

Combinatorics · Mathematics 2023-06-06 Mason R. Calbert , Ryan E. Dougherty