English
Related papers

Related papers: Realizing Computably Enumerable Degrees in Separat…

200 papers

The set of degrees of maps $D(M,N)$, where $M,N$ are closed oriented $n$-manifolds, always contains $0$ and the set of degrees of self-maps $D(M)$ always contains $0$ and $1$. Also, if $a,b\in D(M)$, then $ab\in D(M)$; a set…

Geometric Topology · Mathematics 2025-08-15 Christoforos Neofytidis , Hongbin Sun , Ye Tian , Shicheng Wang , Zhongzi Wang

The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…

Combinatorics · Mathematics 2007-05-29 Dan Bernstein

The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…

Computational Complexity · Computer Science 2014-07-08 Frank Vega Delgado

Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…

Logic · Mathematics 2024-07-24 Masato Fujita

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

Logic in Computer Science · Computer Science 2023-02-13 Benedikt Pago

We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…

Statistical Mechanics · Physics 2014-01-03 P. L. Krapivsky , S. Redner

A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this problem in the random case and show that a random integer…

Combinatorics · Mathematics 2024-08-22 Nicholas Christo , Marcus Michelen

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Representation Theory · Mathematics 2018-11-30 Valdemar V. Tsanov

The separability tensor element of a separable extension of noncommutative rings is an idempotent when viewed in the correct endomorphism ring; so one speaks of a separability idempotent, as one usually does for separable algebras. It is…

Rings and Algebras · Mathematics 2019-08-30 Lars Kadison

For any complex number $c$, let $\sigma_c\colon\mathbb N\rightarrow\mathbb C$ denote the divisor function defined by $\sigma_c(n)=\displaystyle{\sum_{d|n}d^c}$ for all $n\in\mathbb N$, and define $R(c)=\{\sigma_c(n)\in\mathbb C\colon…

Number Theory · Mathematics 2018-01-11 Colin Defant

If a number field has a large degree and discriminant, the computation of the class number becomes quite difficult, especially without the assumption of GRH. In this article, we will unconditionally show that a certain nonabelian number…

Number Theory · Mathematics 2016-07-01 Kwang-Seob Kim , John C. Miller

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…

Number Theory · Mathematics 2021-03-30 Henri Cohen , Peter Stevenhagen

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Representation Theory · Mathematics 2026-02-24 Frank Lübeck

Over a field of characteristic zero, we prove that for each r, there exists a constant C(r) so that the prime ideal of the rth secant variety of any Veronese embedding of any projective space is generated by polynomials of degree at most…

Commutative Algebra · Mathematics 2017-01-12 Steven V Sam

A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…

Logic · Mathematics 2014-02-18 Gregory Igusa

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

We show that if two division $p$-algebras of prime degree share an inseparable field extension of the center then they also share a cyclic separable one. We show that the converse is in general not true. We also point out that sharing all…

Rings and Algebras · Mathematics 2015-03-10 Adam Chapman

Let $k$ be a commutative Noetherian ring and $\underline{\mathscr{C}}$ be a locally finite $k$-linear category equipped with a self-embedding functor of degree 1. We show under a moderate condition that finitely generated torsion…

Representation Theory · Mathematics 2015-10-23 Liping Li

We classify 1-tilting classes over an arbitrary commutative ring. As a consequence, we classify all resolving subcategories of finitely presented modules of projective dimension at most 1. Both these collections are in 1-1 correspondence…

Commutative Algebra · Mathematics 2016-06-06 Michal Hrbek

Let $\mathcal{A}$ be a mathematical structure with an additional relation $R$. We are interested in the degree spectrum of $R$, either among computable copies of $\mathcal{A}$ when $(\mathcal{A},R)$ is a "natural" structure, or (to make…

Logic · Mathematics 2014-12-15 Matthew Harrison-Trainor