相关论文: Kalimullin Pair and Semicomputability in $\alpha$-…

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…

We provide a graded and quantum version of the category of rooted cluster algebras introduced by Assem, Dupont and Schiffler and show that every graded quantum cluster algebra of infinite rank can be written as a colimit of graded quantum…

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

Let $n$ be a maximal nilpotent subalgebra of a complex symmetric Kac-Moody Lie algebra. Lusztig has introduced a basis of U(n) called the semicanonical basis, whose elements can be seen as certain constructible functions on varieties of…

Recently, V.Ginzburg introduced and studied in depth the notion of a principal nilpotent pair in a semisimple Lie algebra \g. Our aim is to contribute to the general theory of nilpotent pairs. Roughly speaking, a nilpotent pair (e_1,e_2)…

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

We give a further development of the Aichinger-Moosbauer calculus of functional degrees of maps between commutative groups. For any fixed given commutative groups $A$ and $B$, we compute the largest possible finite functional degree that a…

In this paper we give conditions under which a topological semigroup can be embedded algebraically and topologically into a compact topological group. We prove that every feebly compact regular first countable cancellative commutative…

We define a canonical quadratic pair on the Clifford algebra of an algebra with quadratic pair over a field. This allows us to extend to the characteristic 2 case the notion of trialitarian triples, from which we derive a characterization…

We develop a general axiomatic theory of algebraic pairs, which simultaneously generalizes several algebraic structures, in order to bypass negation as much as feasible. We investigate several classical theorems and notions in this setting…

We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…

We show the cardinality of a particular nonabelian cohomology associated to cyclic division algebras is equal to a certain partition number. This computation helps us interpret the number of conjugacy classes of maximal tori defined over an…

We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…

Consider an exact couple in a semiabelian category in the sense of Palamodov, i.e., in an additive category in which every morphism has a kernel as well as a cokernel and the induced morphism between coimage and image is always monic and…

The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is…

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

We show that if $\Lambda$ is a $n$-Koszul algebra and $E=E(\Lambda)$ is its Yoneda algebra, then there is a full subcategory $\mathcal{L}_E$ of the category $Gr_E$ of graded $E$-modules, which contains all the graded $E$-modules presented…

We find examples of duality among quantum theories that are related to arithmetic functions by identifying distinct Hamiltonians that have identical partition functions at suitably related coupling constants or temperatures. We are led to…