Related papers: Comparing the degrees of enumerability and the clo…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We classify all finite groups with five relative commutativity degrees. Also, we give a partial answer to our previous conjecture on a lower bound of the number of relative commutativity degrees of finite groups.
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
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 classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…
A commutative algebra is exact if its multiplication endomorphisms are trace-free and is Killing metrized if its Killing type trace-form is nondegenerate and invariant. A Killing metrized exact commutative algebra is necessarily neither…
In this dissertation, we compare the "classical" homology of an $\omega$-category (defined as the homology of its Street nerve) with its polygraphic homology. More precisely, we prove that both homologies generally do not coincide and call…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
We use geometric and cohomological methods to show that given a degree bound for membership in ideals of a fixed degree type in the polynomial ring P=k[x_0,..., x_d], one obtains a good generic degree bound for membership in the tight…
The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…
Vatne and Green & Marcos have independently studied the Koszul-like homological properties of graded algebras that have defining relations in degree 2 and exactly one other degree. We contrast these two approaches, answer two questions…
A degree of a module $M$ is a numerical measure of information carried by $M$. We highlight some of Vasconcelos' outstanding contributions to the theory of degrees, bridging commutative algebra and computational algebra. We present several…
If a nontrivial finite group coacts on a graded noetherian down-up algebra $A$ inner faithfully and homogeneously, then the fixed subring is not isomorphic to $A$. Therefore graded noetherian down-up algebras are rigid with respect to…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
Let $R$ be an excellent Noetherian ring of prime characteristic. Consider an arbitrary nested pair of ideals (or more generally, a nested pair of submodules of a fixed finite module). We do \emph{not} assume that their quotient has finite…
We discuss certain homological properties of graded algebras whose trivial modules admit non-pure resolutions. Such algebras include both of Artin-Schelter regular algebras of types (12221) and (13431). Under certain conditions, a module…
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…