English
Related papers

Related papers: Computable structures of rank omega_1^{CK}

200 papers

We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum…

Programming Languages · Computer Science 2011-10-10 P. Gawron , J. Klamka , J. A. Miszczak , R. Winiarczyk

We introduce the decomposition rank, a notion of covering dimension for nuclear C^*-algebras. The decomposition rank generalizes ordinary covering dimension and has nice permanence properties; in particular, it behaves well with respect to…

Operator Algebras · Mathematics 2007-05-23 Eberhard Kirchberg , Wilhelm Winter

We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…

Dynamical Systems · Mathematics 2013-03-14 Su Gao , Aaron Hill

The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…

Logic in Computer Science · Computer Science 2007-05-23 Frédéric Blanqui

A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…

Data Structures and Algorithms · Computer Science 2023-07-04 Yu-Wei Huang

We study structurable algebras of skew-dimension one. We present two different equivalent constructions for such algebras: one in terms of non-linear isotopies of cubic norm structures, and one in terms of hermitian cubic norm structures.…

Rings and Algebras · Mathematics 2017-12-05 Tom De Medts

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…

Computational Complexity · Computer Science 2010-06-03 Matthew S. Bauer , Xizhong Zheng

Given two baric algebras $(A_1,\omega_1)$ and $(A_2,\omega_2)$ we describe a way to define a new baric algebra structure over the vector space $A_1\oplus A_2$, which we shall denote $(A_1\bowtie A_2,\omega_1\bowtie\omega_2)$. We present…

Rings and Algebras · Mathematics 2013-02-27 Antonio M. Oller-Marcén

Motivated by the structure of certain modules over the loop Virasoro Lie conformal algebra and the Lie structures of Schrodinger-Virasoro algebras, we construct a class of infinite rank Lie conformal algebras CSV (a, b), where a, b are…

Rings and Algebras · Mathematics 2016-09-21 Guangzhe Fan , Yucai Su , Chunguang Xia

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , R. J. Dolbin , Nathan Manning

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Logic · Mathematics 2010-12-07 Su Gao , Peter Gerdes

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), which is the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

In this paper we classify the finite-dimensional pointed rank one Hopf algebras which are generated as algebras by the first element of the coradical filtration over a field of prime characteristic.

Rings and Algebras · Mathematics 2008-02-24 Sarah Scherotzke

An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…

Logic · Mathematics 2026-05-01 Matthew de Brecht

Computability relative to a partial function $f$ on the natural numbers can be formalized using the notion of an oracle for this function $f$. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of…

Category Theory · Mathematics 2021-03-17 Jetze Zoethout

We generalize the $K$ matrix formulation to non-trivial non-Abelian families of 2+1D topological orders. Given a topological order $\mathcal C$, any topological order in the same non-Abelian family as $\mathcal C$ can be efficiently…

Strongly Correlated Electrons · Physics 2019-12-11 Tian Lan

We introduce certain $C^*$-algebras and $k$-graphs associated to $k$ finite dimensional unitary representations $\rho_1,...,\rho_k$ of a compact group $G$. We define a higher rank Doplicher-Roberts algebra $\mathcal{O}_{\rho_1,...,\rho_k}$,…

Operator Algebras · Mathematics 2020-06-26 Valentin Deaconu

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $\mathbf{InfEx}_{\cong}$, consisting of the…

Logic · Mathematics 2021-03-19 Nikolay Bazhenov , Ekaterina Fokina , Luca San Mauro

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…