中文
相关论文

相关论文: Constructive Algebraic Topology

200 篇论文

Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory…

编程语言 · 计算机科学 2022-02-10 Kazuhiko Sakaguchi

Let $X$ be a locally compact Hausdorff space with $n$ proper continuous self maps $\tau_i:X \to X$ for $1 \le i \le n$. To this we associate two topological conjugacy algebras which emerge as the natural candidates for the universal algebra…

算子代数 · 数学 2011-11-09 Kenneth R. Davidson , Elias G. Katsoulis

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

计算机科学中的逻辑 · 计算机科学 2007-05-23 J. V. Tucker , J. I. Zucker

Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…

组合数学 · 数学 2023-07-03 Greta Panova

A family of algebraic surfaces with many nondegenerate real singularities is introduced with the help of a construction, which has been used in previous works for the generation of substitution tilings.

数学物理 · 物理学 2011-11-08 J. G. Escudero

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

组合数学 · 数学 2023-06-02 Ada Stelzer , Alexander Yong

Studies of issues related to computability and computational complexity involve the use of a model of computation. Pivotal to such a model are the computational processes considered. Processes of this kind can be described using an…

计算机科学中的逻辑 · 计算机科学 2024-06-24 C. A. Middelburg

Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…

计算机科学中的逻辑 · 计算机科学 2018-02-12 Daniel Leivant , Jean-Yves Marion

Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…

泛函分析 · 数学 2019-09-04 Wolfgang Bock , Vyacheslav Futorny , Mikhail Neklyudov

In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…

计算机科学中的逻辑 · 计算机科学 2026-05-19 C. A. Middelburg

As dynamic and control systems become more complex, relying purely on numerical computations for systems analysis and design might become extremely expensive or totally infeasible. Computer algebra can act as an enabler for analysis and…

系统与控制 · 计算机科学 2018-01-01 Masoud Abbaszadeh

Using some new logarithmic formal calculus, we construct a well known vertex algebra, obtaining the Jacobi identity directly, in an essentially self-contained treatment.

量子代数 · 数学 2011-06-22 Thomas Robinson

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

代数拓扑 · 数学 2024-12-24 Rodrigo Santos Monteiro

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Martin Escardo

Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…

几何拓扑 · 数学 2021-12-30 Christoph Dorn , Christopher L. Douglas

Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…

分布式、并行与集群计算 · 计算机科学 2020-06-15 Adam Shimi , Armando Castañeda

Many combinatorial optimisation problems hide algebraic structures that, once exposed, shrink the search space and improve the chance of finding the global optimal solution. We present a general framework that (i) identifies algebraic…

人工智能 · 计算机科学 2026-04-08 Min Sun , Federica Storti , Valentina Martino , Miguel Gonzalez-Andrades , Tony Kam-Thong

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

逻辑 · 数学 2022-02-11 Djamel Eddine Amir , Mathieu Hoyrup

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

逻辑 · 数学 2017-06-08 Ayhan Günaydın

Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…

综合数学 · 数学 2008-05-13 Elemer E Rosinger