Related papers: Cyclic Datatypes modulo Bisimulation based on Seco…
We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
SOFT ('Second-Order Functions and Theorems') is a tool to mimic second-order functions and theorems in the first-order logic of ACL2. Second-order functions are mimicked by first-order functions that reference explicitly designated…
Approaching limitations of digital computing technologies have spurred research in neuromorphic and other unconventional approaches to computing. Here we argue that if we want to systematically engineer computing systems that are based on…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$,…
In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…
In this article we show how the data of integrals of algebraic differential forms over algebraic cycles can be used in order to prove that algebraic and Hodge cycle deformations of a given algebraic cycle are equivalent. As an example, we…
Matter exhibits phases and their transitions. These transitions are classified as first-order phase transitions (FOPTs) and continuous ones. While the latter has a well-established theory of the renormalization group, the former is only…
In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field $F=\mathbb{F}_q$. We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate…
A circular program contains a data structure whose definition is self-referential or recursive. The use of such a definition allows efficient functional programs to be written and can avoid repeated evaluations and the creation of…
We establish the foundations of categorical weave calculus, developing the diagrammatic calculus of weaves and braid varieties within the study of Calabi-Yau triangulated categories and cluster tilting theory. This is achieved by…
Dynamical systems are ubiquitous in science and engineering as models of phenomena that evolve over time. Although complex dynamical systems tend to have important modular structure, conventional modeling approaches suppress this structure.…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
Data types and codata types are, as the names suggest, often seen as duals of each other. However, most programming languages do not support both of them in their full generality, or if they do, they are still seen as distinct constructs…
Let $X$ be a smooth variety over a finite field $\mathbb{F}_q$. Let $\ell$ be a rational prime number invertible in $\mathbb{F}_q$. For an $\ell$-adic sheaf $\mathcal{F}$ on $X$, we construct a cycle supported on the singular support of…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…