English
Related papers

Related papers: Many-one reducibility with realizability

200 papers

Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial…

Logic in Computer Science · Computer Science 2016-07-07 Armando B. Matos

Let $\varphi$ be a quasi-psh function on a complex manifold $X$ and let $S\subset X$ be a complex submanifold. Then the multiplier ideal sheaves $\mathcal{I}(\varphi|_S)\subset\mathcal{I}(\varphi)|_{S}$ and the complex singularity exponents…

Complex Variables · Mathematics 2021-01-21 Xiankui Meng , Xiangyu Zhou

Several reachability problems in finite automata, such as completeness of NFAs and synchronisation of total DFAs, correspond to fundamental properties of sets of nonnegative matrices. In particular, the two mentioned properties correspond…

Formal Languages and Automata Theory · Computer Science 2025-07-25 Stefan Kiefer , Andrew Ryzhikov

We show that every absolute-valued algebra with left-unit satisfying (x2; x2; x2) = 0 is finite-dimensional of degree at most 4: Next, we determine such an algebras. In addition to the already known algebras R; C; \astC; H; \astH; \astH(i;…

Rings and Algebras · Mathematics 2011-09-02 Alassane Diouf , Maribel Ramirez , Abdellatif Rochdi

For a semisimple real Lie group $G$ with an irreducible representation $\rho$ on a finite-dimensional real vector space $V$, we give a sufficient criterion on $\rho$ for existence of a group of affine transformations of $V$ whose linear…

Group Theory · Mathematics 2024-02-28 Ilia Smilga

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

Logic · Mathematics 2007-05-23 Steffen Lempp , Theodore A. Slaman

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter

We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…

Probability · Mathematics 2016-09-12 Wolfgang Löhr , Thomas Rippl

We prove the existence of $N - 1$ distinct pairs of nontrivial solutions of the scalar field equation in ${\mathbb R}^N$ under a slow decay condition on the potential near infinity, without any symmetry assumptions. Our result gives more…

Analysis of PDEs · Mathematics 2013-12-23 Kanishka Perera

We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…

Combinatorics · Mathematics 2013-12-23 Jacob A. White

We prove a finiteness theorem for the class of complete finite volume Riemannian manifolds with pinched negative sectional curvature, fixed fundamental group, and of dimension $>2$. One of the key ingredients is that the fundamental group…

Differential Geometry · Mathematics 2007-05-23 Igor Belegradek

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Number Theory · Mathematics 2021-06-21 Olli Järviniemi

In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…

Symbolic Computation · Computer Science 2009-12-30 Xiaorong Hou , Song Xu , Junwei Shao

We construct, for $m\geq 6$ and $2n\leq m$, closed manifolds $M^{m}$ with finite nonzero $\varphi(M^{m},S^{n}$), where $\varphi(M,N)$ denotes the minimum number of critical points of a smooth map $M\to N$. We also give some explicit…

Geometric Topology · Mathematics 2019-01-25 Louis Funar , Cornel Pintea

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

Logic · Mathematics 2014-02-10 Itaï Ben Yaacov , Arthur Paul Pedersen

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger

Let $\Omega$ be a domain in $R^n$, and let $N=3\cdot 2^{n-1}$. We prove that the trace of the space $C^2(\Omega)$ to the boundary of $\Omega$ has the following finiteness property: A function $f:\partial\Omega\to R$ is the trace to the…

Functional Analysis · Mathematics 2024-06-10 Pavel Shvartsman

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

We show that irreducibility is not a first-order definable property of real algebraic varieties. The proof is based on the recent o-minimality result for the exponential function. We conjecture that irreducibility is not a definable…

Logic · Mathematics 2009-10-31 Pascal Koiran

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

Group Theory · Mathematics 2008-04-02 Laurent Bartholdi