中文
相关论文

相关论文: The Isomorphism Problem for Computable Abelian p-G…

200 篇论文

Let $C$ be a smooth non rational projective curve over the complex field $\mathbb{C}$. If $A$ is an abelian subvariety of the Jacobian $J(C)$, we consider the Abel-Prym map $\varphi_A : C \rightarrow A$ defined as the composition of the…

代数几何 · 数学 2020-02-10 Juliana Coelho , Kelyane Abreu

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

数据结构与算法 · 计算机科学 2013-12-12 David Rosenbaum

Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…

群论 · 数学 2015-09-21 David Stanovský , Petr Vojtěchovský

The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…

交换代数 · 数学 2025-12-19 Diego Lobos

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

逻辑 · 数学 2023-04-07 I. Sh. Kalimullin

The theory of bounded cohomology of groups has many applications. A key open problem is to compute the full bounded cohomology $H_b^n(F, R)$ of a non-abelian free group $F$ with trivial real coefficients. It is known that $H_b^n(F,R)$ is…

群论 · 数学 2018-12-18 Nicolaus Heuer

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…

计算机科学中的逻辑 · 计算机科学 2015-02-24 Emanuele D'Osualdo , Luke Ong

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

逻辑 · 数学 2012-11-28 Mohammad Assem

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

Let $A$ be a finite dimensional algebra and $D^b(A)$ be the bounded derived category of finitely generated left $A$-modules. In this paper we consider lengths of compact exceptional objects in $D^b(A)$, proving a sufficient condition such…

表示论 · 数学 2016-05-04 Liping Li

We enumerate the number of isoclinism classes of semi-extraspecial $p$-groups with derived subgroup of order $p^2$. To do this, we enumerate $\text{GL}(2, p)$-orbits of sets of irreducible, monic polynomials in $\mathbb{F}_p[x]$. Along the…

群论 · 数学 2020-04-22 Mark L. Lewis , Joshua Maglione

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

组合数学 · 数学 2024-11-13 Ted Dobson , Gregory Robson

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

逻辑 · 数学 2020-01-29 Dan Turetsky

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

逻辑 · 数学 2022-08-30 Tapani Hyttinen , Jouko Väänänen

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…

组合数学 · 数学 2016-09-07 Sergey Yuzvinsky

Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…

表示论 · 数学 2019-10-15 Gabriella D'Este , Fatma Kaynarca , Derya Keskin Tütüncü

Coclass theory can be used to define infinite families of finite p-groups of a fixed coclass. It is conjectured that the groups in one of these infinite families all have isomorphic mod-p cohomology rings. Here we prove that almost all…

群论 · 数学 2015-03-31 Bettina Eick , David J. Green

We study generic properties of topological groups in the sense of Baire category. First we investigate countably infinite (discrete) groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed…

A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generation of Hamiltonian groups. In this paper, a complete classification of finite metahamiltonian $p$-groups is given.

群论 · 数学 2017-08-17 Xingui Fang , Lijian An