Searcharxiv⌕ Search

COMPUTER SCIENCE · arXiv

Search arXiv papers.
From AI to robotics.

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

3,238,243 indexed recordsarXiv

Search covers this site's imported records. Source coverage & methodology ↗

arXiv subjects
cs.AI / cs.CL / cs.CV / cs.RODecorative illustration

EXPLORE A SUBJECT

arXiv subjects

All collections ↗

SOURCE RECORDS

arXiv papers in this index

View all 3,238,243 records ↗

O-segments on topological measure spaces

Let $μ$ be a finite non-atomic measure on a set $X$. A \emph{segment} for $μ$ is an increasing family $u(t)$, $t\in[0,1]$, of measurable sets with $u(0)=\emptyset$, $u(1)=X$ and $μ(u(t))=t\,μ(X)$; by a theorem of Fryszkowski, finitely many measures $f\,dμ$ admit a common segment. We study \emph{open segments}, i.e.\ segments consisting of open sets, when $X$ carries a topology. We show that weak outer regularity of $μ$ is equivalent to the approximability of measurable sets by open sets, and that it holds for every finite Borel measure on a metrizable space. Our main result states that if $μ$ is finite, non-atomic and weakly outer regular, then for all $f,g\in L^1(μ)$ with $(\int f\,dμ,\int g\,dμ)\neq(0,0)$ there is a common open segment for $f\,dμ$ and $g\,dμ$; in particular, for every $f\in L^1(μ)$ there is an open segment for $μ$ which is simultaneously a segment for $f\,dμ$. Relative versions allow one to prescribe an initial set. We also characterize open segments as upper semicontinuous functions with uniform distribution and show that on separable metrizable spaces a single measure admits such a function which is continuous.

math.FA↗

Magnetism and infrared divergence in a Hubbard-phonon interacting system

We study a finite Hubbard model coupled to a massless phonon field through a form factor common to all sites that satisfies the infrared singular condition. The Hamiltonian has no ground state in the Fock representation. With the unitary transformation of Arai and Hirokawa, the ground states with infrared cutoff define states on the Weyl algebra over the form domain of the inverse dispersion, and they converge to a ground state in a representation inequivalent to the Fock representation. In this representation the ground states are the products of the ground states of the Hubbard model and the phonon vacuum, so that the model has ferromagnetic or unique spin-singlet ground states according to the hopping matrix and the electron number.

math-ph↗

Phonon Bose-Einstein condensation in a Hubbard-phonon interacting system with infrared divergence

We study the grand canonical Gibbs states of a finite Hubbard model coupled to massless phonons with the dispersion relation $|k|^s$, $1\leq s<d$, at finite temperature. We keep the decoupling setting of the zero-temperature analysis, in which the electron-phonon form factor is common to all sites. An explicit unitary transformation factorizes the Gibbs state into the electron Gibbs state and the free phonon Gibbs state up to a phase, and the phonons exhibit Bose-Einstein condensation in the thermodynamic limit with the critical density of the free Bose gas. Assuming the convergence of this phase as the infrared cutoff is removed, the condensed state is the mixture of mutually disjoint component states with broken gauge symmetry, described by their expectations on the Weyl algebra. Physically, phonons are considered not to undergo Bose-Einstein condensation arxiv:1207.4621, and the study of a mechanism that suppresses this mathematical and formal condensation is left for future research.

math-ph↗

Sharp Poincaré inequalities for the logarithmic smoothness of the Gauss map on hypersurfaces

We establish sharp lower bounds for two geometric functionals which evaluate the global variation of the Gauss map on the boundary of bounded open sets $Ω\subset\mathbb{R}^d$. These functionals arise as the endpoint case $s=0$ of the Gagliardo seminorm in $W^{s,p}(\partialΩ)$ of the normal vector field, for $p\in\{1,2\}$. We also show that balls are the unique minimizers. In addition, some applications to the fractional setting $s>0$ are given.

math.AP↗

Everlasting secure key agreement from a quantum computational hybrid security model

We introduce the Quantum Computational Timelock (QCT) model, combining time-lock encryption with a quantitative noisy-quantum-storage assumption. Time-lock encryption gives Bob immediate access to the encoding seed and gives Eve the same final information as access to that seed only after a protected interval. Eve may then process her retained information without computational restriction. We state this delayed-access encryption assumption explicitly and construct MUB-QCT from a complete set of mutually unbiased bases in dimension $d$ and an affine pair-wise independent permutation family. For single-copy encoding, every seed-independent immediate measurement has trace-distance advantage at most $1/(2\sqrt{d+1})$ and mutual information at most $1/(d+1)$. Effective residual storage at diamond distance at most $δ$ from replacement adds at most $δ$ to the individual-attack distinguishing bound. Under i.i.d. individual attacks and entropy-preserving acceptance, we obtain an asymptotic key-rate bound and formulate final-key secrecy in composable trace distance. For $m$ independently randomized signals sharing one bit and seed, the optimal leakage under non-adaptive product measurements is $\min\{1,m/(d+1)\}$, allowing a linear-in-$d$ detection enhancement in that attack model. We also construct a seed-independent joint measurement that recovers the bit after disclosure with error at most $\varepsilon$ from $O(\log d+\log(1/\varepsilon))$ signals, retaining only classical information after measurement. This gives a quantitative separation between product and joint measurements. Bob uses two logical detection outcomes independently of $d$.

quant-ph↗

On the minimum bisection of random $3$-regular graphs

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

math.PR↗
FOLLOW THE SOURCE

arXiv abstracts & original papers

Follow the arXiv record for the manuscript, author list and available versions.

Sources & methodology ↗