中文
相关论文

相关论文: The Complexity of the Core Model

200 篇论文

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

代数拓扑 · 数学 2026-05-07 Daisuke Kishimoto , Yuki Minowa

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…

We show that, associated with any complex root of unity $\omega$, there exists a particularly simple 4d-TQFT model $M_\omega$ defined on the cobordism category of Delta complexes. For an oriented closed 4-manifold $X$ of Euler…

几何拓扑 · 数学 2014-05-23 Rinat Kashaev

Let $p$ be a fixed prime. We show that the number of isomorphism classes of finite rings of order $p^n$ is $p^\alpha$, where $\alpha=\frac{4}{27}n^3+O(n^{5/2})$. This result was stated (with a weaker error term) by Kruse and Price in 1969;…

组合数学 · 数学 2022-05-06 Simon R. Blackburn , K. Robin McLean

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

组合数学 · 数学 2012-05-03 B. S. Kochkarev

Using group actions and orbit-stabilizer methods, we study the geometry of isomorphism classes of finite-dimensional $\omega$-Lie algebras over a field $\mathbb{K}$ of characteristic $\neq 2$ and establish a one-to-one correspondence…

环与代数 · 数学 2026-03-24 Yin Chen , Shan Ren , Runxuan Zhang

If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when…

动力系统 · 数学 2015-02-26 Tomasz Downarowicz , Eli Glasner

The best way to model, understand, and quantify the information contained in complex systems is an open question in physics, mathematics, and computer science. The uncertain relationship between entropy and complexity further complicates…

机器学习 · 计算机科学 2022-11-10 Stephen Casey

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

逻辑 · 数学 2020-01-23 Nikolay Bazhenov , Luca San Mauro

In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…

逻辑 · 数学 2009-05-05 Fairouz Kamareddine , Karim Nour

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

环与代数 · 数学 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…

几何拓扑 · 数学 2018-07-20 Max Neumann-Coto , Macarena Covadonga Robles Arenas

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

计算机科学中的逻辑 · 计算机科学 2010-01-14 Dietrich Kuske , Jiamou Liu , Markus Lohrey

The well-known theorem of Eilenberg and Ganea expresses the Lusternik - Schnirelmann category of an aspherical space as the cohomological dimension of its fundamental group. In this paper we study a similar problem of determining…

代数拓扑 · 数学 2017-08-29 Michael Farber , Stephan Mescher

We show that every $PD_3$-complex $P$ bounds a $PD_4$-pair $(Z,P)$. If $P$ is orientable we may assume that $\pi_1(Z)=1$. We show also that if $P$ has a manifold 1-skeleton then it is homotopy equivalent to a closed 3-manifold, and that if…

几何拓扑 · 数学 2023-01-18 Jonathan A. Hillman

We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…

一般拓扑 · 数学 2020-02-19 Adam Bartoš

The Ising critical exponents $\eta$, $\nu$ and $\omega$ are determined up to one-per-thousand relative error in the whole range of dimensions $3 \le d < 4$, using numerical conformal-bootstrap techniques. A detailed comparison is made with…

高能物理 - 理论 · 物理学 2023-06-13 Claudio Bonanno , Andrea Cappelli , Mikhail Kompaniets , Satoshi Okuda , Kay Jörg Wiese

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

逻辑 · 数学 2012-09-19 Tapani Hyttinen , Vadim Kulikov

We analyse omega-categorical precompact expansions of particular omega-categorical structures from the viewpoint of amenability of their automorphism groups. The main result of the paper corrects and simplifies Section 3.2 of the first…

逻辑 · 数学 2017-01-27 A. Ivanov

A method is provided for computing an upper bound of the complexity of a module over a local ring, in terms of vanishing of certain cohomology modules. We then specialize to complete intersections, which are precisely the rings over which…

交换代数 · 数学 2007-06-26 Petter Andreas Bergh