Related papers: The Block Relation in Computable Linear Orders
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
We classify finite irreducible conformal modules over a class of infinite Lie conformal algebras ${\frak {B}}(p)$ of Block type, where $p$ is a nonzero complex number. In particular, we obtain that a finite irreducible conformal module over…
In this paper, we consider block languages, namely sets of words having the same length, and we propose a new representation for these languages. In particular, given an alphabet of size $k$ and a length $\ell$, a block language can be…
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
Correlation matrices are omnipresent in multivariate data analysis. When the number d of variables is large, the sample estimates of correlation matrices are typically noisy and conceal underlying dependence patterns. We consider the case…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…
The aim of this paper is to study a Lie conformal algebra of Block type. In this paper, conformal derivation, conformal module of rank 1 and low-dimensional comohology of the Lie conformal algebra of Block type are studied. Also, the vertex…
We prove that if $B$ is a $p$-block with non-trivial defect group $D$ of a finite $p$-solvable group $G$, then $\ell(B) < p^r$, where $r$ is the sectional rank of $D$. We remark that there are infinitely many $p$-blocks $B$ with non-Abelian…
Let $\mathcal B(\delta)$ be the Brauer category over the complex field $\mathbb C$ with the parameter $\delta$. In non-semisimple case, $\delta$ is an integer, and each weight space of $(\frac{\delta}2-1)$th semi-infinite wedge space…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
In the framework of model-based clustering, a model allowing several latent class variables is proposed. This model assumes that the distribution of the observed data can be factorized into several independent blocks of variables. Each…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
We show that conformal blocks simplify greatly when there is a large difference between two of the scaling dimensions for external operators. In particular the spacetime dimension only appears in an overall constant which we determine via…
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…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
Following a recently considered generalization of linear equations to unordered data vectors, we perform a further generalization to ordered data vectors. These generalized equations naturally appear in the analysis of vector addition…
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…