中文
相关论文

相关论文: Computable Scott Sentences for Quasi-Hopfian Finit…

200 篇论文

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

群论 · 数学 2023-09-29 Nikolay Nikolov

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

算子代数 · 数学 2025-02-26 Huaxin Lin

The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular…

组合数学 · 数学 2026-05-14 Mudit Aggarwal , Murray Elder , Andrew Rechnitzer

Let $k$ be a field. In this paper, we introduce the notions of $\textit{reduction order}$ and $\textit{reduction-factorization}$ on words, and use them to show that any right or left Noetherian pointed Hopf algebra over $k$ is affine. This…

量子代数 · 数学 2025-12-01 Huan Jia , Yinhuo Zhang

Lusztig conjectured that the almost characters of a finite reductive group are up to a scalar the same as the characteristic functions of the rational character sheaves defined on the corresponding algebraic group. We propose in this paper…

表示论 · 数学 2007-05-23 Olivier Brunat

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

表示论 · 数学 2010-12-03 Jinkui Wan

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

逻辑 · 数学 2012-01-25 Jeffry L. Hirst , Carl Mummert

We show that for quasi-compact quasi-separated schemes of finite dimension, the constructibility condition in real \'etale cohomology agrees with a notion of constructibility arising naturally from topology. As application we prove that the…

代数几何 · 数学 2022-01-04 Fangzhou Jin

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

群论 · 数学 2014-11-06 Rupert McCallum

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

计算机科学中的逻辑 · 计算机科学 2019-05-14 Lê Thành Dũng Nguyên

We compute the representation-theoretic rank of a finite dimensional quasi-Hopf algebra $H$ and of its quantum double $D(H)$, within the rigid braided category of finite dimensional left $D(H)$-modules.

量子代数 · 数学 2007-05-23 Daniel Bulacu , Blas Torrecillas

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

计算机科学中的逻辑 · 计算机科学 2024-12-02 Daumantas Kojelis

We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that…

计算机科学中的逻辑 · 计算机科学 2016-07-15 Peter Hertling

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

逻辑 · 数学 2018-11-06 Rumen Dimitrov , Valentina Harizanov , Andrey Morozov

We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complexity and show that it only preserves…

逻辑 · 数学 2026-02-11 David Gonzalez , Dino Rossegger

We define equivariant semiprojectivity for C*-algebras equipped with actions of compact groups. We prove that the following examples are equivariantly semiprojective: arbitrary finite dimensional C*-algebras with arbitrary actions of…

算子代数 · 数学 2011-12-21 N. Christopher Phillips

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

群论 · 数学 2013-01-16 Desmond Cummins

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

逻辑 · 数学 2011-07-20 Isaac Goldbring

Not long ago, Cirici and Wilson defined a Dolbeault cohomology on almost complex manifolds to answer Hirzebruch's problem. In this paper, we define a refined Dolbeault cohomology on almost complex manifolds. We show that the condition…

微分几何 · 数学 2024-04-30 Dexie Lin