惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

小众软件
小众软件
C
Check Point Blog
Vercel News
Vercel News
Y
Y Combinator Blog
G
Google Developers Blog
P
Proofpoint News Feed
WordPress大学
WordPress大学
MongoDB | Blog
MongoDB | Blog
博客园 - 司徒正美
Last Week in AI
Last Week in AI
博客园 - 【当耐特】
N
Netflix TechBlog - Medium
L
LangChain Blog
V
V2EX
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
大猫的无限游戏
大猫的无限游戏
D
DataBreaches.Net
博客园_首页
B
Blog RSS Feed
The Cloudflare Blog
MyScale Blog
MyScale Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Microsoft Security Blog
Microsoft Security Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Generic properties of dispersion relations for discrete p...
Ngoc T. Do, Peter Kuchment, Frank Sottile · 2019-10-15 · via math.CO updates on arXiv.org

An old problem in mathematical physics deals with the structure of the dispersion relation of the Schrödinger operator $-Δ+V(x)$ in $R^n$ with periodic potential near the edges of the spectrum. A well known conjecture says that generically (with respect to perturbations of the periodic potential) the extrema are attained by a single branch of the dispersion relation, are isolated, and have non-degenerate Hessian (i.e., dispersion relations are graphs of Morse functions). The important notion of effective masses in solid state physics, as well as Liouville property, Green's function asymptotics, etc. hinge upon this property. The progress in proving this conjecture has been slow. It is natural to try to look at discrete problems, where the dispersion relation is (in appropriate coordinates) an algebraic, rather than analytic, variety. Such models are often used for computation in solid state physics (the tight binding model). Alas, counterexamples exist in some discrete situations. We start establishing the following dichotomy: the non-degeneracy of extrema either fails or holds in the complement of a proper algebraic subset of the parameters. The known counterexample has only two free parameters. This might be too tight for genericity to hold. We consider the maximal $Z^2$-periodic two-atomic nearest-cell interaction graph, with nine edges per unit cell and the discrete "Laplace-Beltrami" operator on it. We then use methods from computational and combinatorial algebraic geometry to prove the genericity conjecture for this graph. We show three different approaches to the genericity, which might be suitable in various situations. It is also proven in this case that adding more parameters does not destroy the genericity result. We list all "bad" periodic subgraphs of the one we consider and discover that in all these cases genericity fails for "trivial" reasons only.