English
Related papers

Related papers: A Locale for Minimal Bad Sequences

200 papers

We attempt to systematically derive perturbative quantum corrections to the Berry diagonal approximation of the two-level correlation function (TLCF) for chaotic systems. To this end, we develop a ``weak diagonal approximation'' based on a…

Mesoscale and Nanoscale Physics · Physics 2009-10-31 Robert S. Whitney , Igor V. Lerner , Robert A. Smith

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

Information Theory · Computer Science 2019-12-13 Daniele Bartoli , Matteo Bonini , Burçin Güneş

We define and study the categorical sequence of a space, which is a new formalism that streamlines the computation of the Lusternik-Schnirelmann category of a space X by induction on its CW skeleta. The k-th term in the categorical sequence…

Algebraic Topology · Mathematics 2009-04-06 Rob Nendorf , Nick Scoville , Jeffrey Strom

We give local conditions at the infinite places of a number field K ensuring that the intersection of n quadrics in projective N-space over K, N >> n, satisfies weak approximation.

Number Theory · Mathematics 2007-05-23 Bo-Hae Im , Michael Larsen

In this paper we continue our study of local rigidity for maps of CR submanifolds of the complex space. We provide a linear sufficient condition for local rigidity of finitely nondegenerate maps between minimal CR manifolds. Furthermore, we…

Complex Variables · Mathematics 2021-06-15 Giuseppe della Sala , Bernhard Lamel , Michael Reiter

These are the lecture notes of an introductory course on ordinal analysis. Our selection of topics is guided by the aim to give a complete and direct proof of a mathematical independence result: Kruskal's theorem for binary trees is…

Logic · Mathematics 2022-04-22 Anton Freund

We generalize a classical theorem of Besicovitch, showing that, for any positive integers $k<n$, if $E\subset \mathbb R^n$ is a Souslin set which is not $\mathcal{H}^k$-$\sigma$-finite, then $E$ contains a purely unrectifiable closed set…

Classical Analysis and ODEs · Mathematics 2023-08-15 Camillo De Lellis , Ian Fleschler

The main achievement of this paper is to provide a structure theorem for Artinian, Gorenstein local rings with the property that the square of the maximal ideal is generated by two elements. The moduli problem for this class of local…

Commutative Algebra · Mathematics 2007-09-21 Juan Elias , Giuseppe Valla

We introduce the notion of linear multifractional stable sheets in the broad sense (LMSS) with $\alpha\in(0,2]$, to include both linear multifractional Brownian sheets ($\alpha=2$) and linear multifractional stable sheets ($\alpha<2$). The…

Probability · Mathematics 2022-06-16 Yujia Ding , Qidi Peng , Yimin Xiao

In this paper, we explain a simple and uniform construction of a smooth integral model associated to a quadratic, (anti)-hermitian, and (anti)-quaternionic hermitian lattice defined over an arbitrary local field. As one major application,…

Number Theory · Mathematics 2019-05-20 Sungmun Cho

We prove the existence of periodic tessellations of $\mathbb{R}^N$ minimizing a general nonlocal perimeter functional, defined as the interaction between a set and its complement through a nonnegative kernel, which we assume to be either…

Analysis of PDEs · Mathematics 2024-08-22 Annalisa Cesaroni , Ilaria Fragalà , Matteo Novaga

We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…

Combinatorics · Mathematics 2023-06-05 Eng Keat Hng

Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but…

Optimization and Control · Mathematics 2014-07-07 Anders Forsgren , Margaret H. Wright

Large language models (LLMs) demonstrate impressive few-shot learning capabilities, but their performance varies widely based on the sequence of in-context examples. Key factors influencing this include the sequence's length, composition,…

Computation and Language · Computer Science 2025-03-12 Xiang Gao , Ankita Sinha , Kamalika Das

We consider methods for obtaining local lower bounds on characteristics of quantum (correspondingly, classical) systems, i.e. lower bounds valid in the trace norm $\epsilon$-neighborhood of a given state (correspondingly, probability…

Quantum Physics · Physics 2023-04-25 M. E. Shirokov

Tree path minimum query problem is a fundamental problem while processing trees, and is used widely in minimum spanning tree verification and randomized minimum spanning tree algorithms. In this paper, we study the possibility of building…

Data Structures and Algorithms · Computer Science 2021-05-06 Tianqi Yang

We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…

Information Theory · Computer Science 2018-02-06 Antonio Campello

Let K be a complete, algebraically closed nonarchimedean valued field, and let f(z) in K(z) be a rational function of degree d at least 2. We give an algorithm to determine whether f(z) has potential good reduction over K, based on a…

Dynamical Systems · Mathematics 2013-04-08 Robert Rumely

A weakly consecutive sequence (WCS) is a permutation $\sigma$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $\sigma(i)$, then $d$ also divides $\sigma(i \pm d)$ insofar as these are defined. The structure of weakly consecutive…

Combinatorics · Mathematics 2024-01-19 Thomas Garrison , Chris Seiler , Andrew Knowles

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

Logic in Computer Science · Computer Science 2008-10-16 Viorica Sofronie-Stokkermans