English
Related papers

Related papers: Degrees bounding principles and universal instance…

200 papers

The Robinson Splitting Theorem states that a c.e. degree $\mathbf{b}$ splits over any low c.e. degree $\mathbf{c}<\mathbf{b}$. We prove that a weaker version of this theorem holds in models of $\mathrm{P}^-+\mathrm{I}\Sigma_1$, with lowness…

Logic · Mathematics 2026-03-05 Yong Liu , Cheng Peng , Mengzhou Sun

A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \Gamma. We study how hard it is to evaluate this number approximately. There is an…

Computational Complexity · Computer Science 2012-04-26 Colin McQuillan

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

Combinatorics · Mathematics 2016-05-25 Hao Huang , Yi Zhao

In this note we introduce and study a new class of maps called oriented colored broken submersions. This is the simplest class of maps that satisfies a version of the b-principle and in dimension 2 approximates the class of oriented…

Algebraic Topology · Mathematics 2021-01-11 Rustam Sadykov

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Logic · Mathematics 2024-12-23 Lorna Gregory

Starting from an integral projective variety $Y$ equipped with a very ample, non-special and not-secant defective line bundle $\mathcal{L}$, the paper establishes, under certain conditions, the regularity of $(Y \times \mathbb…

Algebraic Geometry · Mathematics 2023-12-05 Edoardo Ballico , Alessandra Bernardi , Tomasz Mańdziuk

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…

Number Theory · Mathematics 2019-11-01 Daniel Altman

As is well known, Buss' theory of bounded arithmetic $S^{1}_{2}$ proves $\Sigma_{0}^{b}(\Sigma_{1}^{b})-LIND$; however, we show that Allen's $D_{2}^{1}$ does not prove $\Sigma_{0}^{b}(\Sigma_{1}^{b})-LLIND$ unless $P = NC$. We also give…

Logic in Computer Science · Computer Science 2007-05-23 Aleksandar Ignjatovic

The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…

A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which…

Logic · Mathematics 2014-12-03 Ludovic Patey

For $n\geq 3$, let $M$ be an $(n+r)$-dimensional irreducible Hermitian symmetric space of compact type and let $\mathcal{O}_M(1)$ be the ample generator of $Pic(M)$. Let $Y=H_1\cap\dots\cap H_r$ be a smooth complete intersection of…

Algebraic Geometry · Mathematics 2018-10-23 Jie Liu

In this article we show that for SDEs with a drift coefficient that is non-locally integrable, one may define a tamed Euler scheme that converges in $L^p$ at rate $1/2$ to the true solution. The taming is required in this case since one…

Probability · Mathematics 2024-08-16 Tim Johnston , Sotirios Sabanis

We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is the standard representation of a PA-provable formula. We show…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We show that there exists a constant $c>0$ such that every $n$-vertex tree $T$ with $\Delta(T)\le cn$ has Ramsey number $R(T)=\max\{t_1+2t_2,2t_1\}-1$, where $t_1\ge t_2$ are the sizes of the bipartition classes of $T$. This improves an…

Combinatorics · Mathematics 2025-09-10 Richard Montgomery , Matías Pavez-Signé , Jun Yan

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

This paper contains results on stable bundles of rank 2 with space of sections of dimension 4 on a smooth irreducible projective algebraic curve $C$. There is a known lower bound on the degree for the existence of such bundles; the main…

Algebraic Geometry · Mathematics 2014-01-31 I. Grzegorczyk , V. Mercat , P. E. Newstead

$\tau$-tilting theory can be thought of as a generalization of the classical tilting theory which allows mutations at any indecomposable summand of a support $\tau$-tilting pair. Indeed, for any algebra $\Lambda$ its tilting modules…

Representation Theory · Mathematics 2025-12-17 Jonah Berggren , Khrystyna Serhiyenko

Suppose $T$ and $S$ are bounded adjointable operators between Hilbert C*-modules admitting bounded Moore-Penrose inverse operators. Some necessary and sufficient conditions are given for the reverse order law $(TS)^{ \dag} =S^{ \dag} T^{…

Operator Algebras · Mathematics 2014-03-27 Kamran Sharifi , Behnaz Ahmadi Bonakdar

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

Combinatorics · Mathematics 2024-09-13 Sean Prendiville

We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an…

Logic in Computer Science · Computer Science 2020-05-04 Libor Barto , Marcin Kozik , Johnson Tan , Matt Valeriote
‹ Prev 1 3 4 5 6 7 10 Next ›