English
Related papers

Related papers: The linear refinement number and selection theory

200 papers

Let $F$ be a linear combination of $N\geq 1$ Dirichlet $L$-functions attached to even (or odd) primitive characters with the same modulus. Selberg proved that a positive proportion of non-trivial zeros of $F$ lie on the critical line. Our…

Number Theory · Mathematics 2023-12-01 Jérémy Dousselin

A matrix \( A \) is called \emph{kernel partition regular} if, for every finite coloring of the natural numbers \( \mathbb{N} \), there exists a monochromatic solution to the equation \( A\vec{X} = 0 \). In 1933, Rado characterized such…

Combinatorics · Mathematics 2025-07-24 Sayan Goswami

Foundation models often generate unreliable answers, while heuristic uncertainty estimators fail to fully distinguish correct from incorrect outputs, causing users to accept erroneous answers without any statistical guarantee. We address…

Artificial Intelligence · Computer Science 2026-05-27 Zhiyuan Wang , Aniri , Tianlong Chen , Yue Zhang , Heng Tao Shen , Xiaoshuang Shi , Kaidi Xu

Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…

Algebraic Geometry · Mathematics 2020-10-28 Miguel Ángel Barja , Rita Pardini , Lidia Stoppino

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

Logic · Mathematics 2016-09-06 Andres Villaveces

We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and…

Logic · Mathematics 2025-04-30 Vera Fischer , Sy David Friedman , David Schrittesser , Asger Törnquist

The paper is an extensive and systematic study of cardinal invariants we call slalom numbers, describing the combinatorics of sequences of sets of natural numbers. Our general approach, based on relational systems, covers many such cardinal…

It is a consequence of the axiom of choice that every preorder can be extended to a total preorder while respecting the strict preorder relation. We call such an extension a prelinearization of the preorder and study the extent to which the…

Logic · Mathematics 2026-02-17 Azul Fatalini , Luke Serafin

Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…

Logic · Mathematics 2016-08-09 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

Probability · Mathematics 2024-07-25 Dylan J. Altschuler

We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…

Logic · Mathematics 2025-02-03 Douglas Blue , Paul B. Larson , Grigor Sargsyan

The classical Rellich inequalities imply that the $L^2$-norms of the normal and tangential derivatives of a harmonic function are equivalent. In this note, we prove several refined inequalities, which make sense even if the domain is not…

Analysis of PDEs · Mathematics 2022-09-20 Siddhant Agrawal , Thomas Alazard

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski

This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…

Numerical Analysis · Mathematics 2019-10-18 Juan Pablo Borthagaray , Wenbo Li , Ricardo H. Nochetto

The defective chromatic number of a graph class is the infimum $k$ such that there exists an integer $d$ such that every graph in this class can be partitioned into at most $k$ induced subgraphs with maximum degree at most $d$. Finding the…

Combinatorics · Mathematics 2024-12-16 Chun-Hung Liu

Following D. Sobota we call a family $\mathcal F$ of infinite subsets of $\mathbb N$ a Rosenthal family if it can replace the family of all infinite subsets of $\mathbb N$ in classical Rosenthal's Lemma concerning sequences of measures on…

Logic · Mathematics 2019-11-18 Piotr Koszmider , Arturo Martínez-Celis

Let $F$ be the field of $q$ elements. We investigate the following Ramsey coloring problem for vector spaces: Given a vector space $\F^n$, give a coloring of the points of $F^n$ with two colors such that no affine line (i.e., affine…

Computational Complexity · Computer Science 2013-12-05 Ariel Gabizon

We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…

Logic · Mathematics 2015-10-21 Barnabás Farkas , Yurii Khomskii , Zoltán Vidnyánszky

This paper deals with the \emph{integral} version of the Dirichlet homogeneous fractional Laplace equation. For this problem weighted and fractional Sobolev a priori estimates are provided in terms of the H\"older regularity of the data. By…

Numerical Analysis · Mathematics 2017-01-11 Gabriel Acosta , Juan Pablo Borthagaray

Let $\mathcal{I}$ be an ideal on $\omega$. For $f,g\in\omega^\omega$ we write $f \leq_{\mathcal{I}} g$ if $f(n) \leq g(n)$ for all $n\in\omega\setminus A$ with some $A\in\mathcal{I}$. Moreover, we denote…

Logic · Mathematics 2023-08-01 Rafał Filipów , Adam Kwela