Related papers: On the computability of cofinal Fra\"iss\'e limits
We develop the foundations of effective ultraproducts of fields and their Galois groups using the methods of computability theory. These computability-theoretic analogs of ultraproducts are called cohesive products, since the role of an…
In this paper we describe the Fra\"iss\'e limit of finite MV-algebras and then prove that finite MV-algebras verify the Ramsey property. Then we show that MV-algebras are just a special case of a more general situation. In fact, under…
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…
This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…
Let \Gamma be a non-cocompact lattice on a locally finite regular right-angled building X. We prove that if \Gamma has a strict fundamental domain then \Gamma is not finitely generated. We use the separation properties of subcomplexes of X…
We present homogeneous age determinations for a large sample of 55 Galactic globular clusters, which constitute about 30% of the total Galactic population. A study of their age distribution reveals that all clusters from the most metal poor…
Arbitrary-precision integer multiplication is the core kernel of many applications in simulation, cryptography, etc. Existing acceleration of arbitrary-precision integer multiplication includes CPUs, GPUs, FPGAs, and ASICs. Among these…
In this paper, we study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained as follows: Given an IP formulation, we first generate a…
The main properties of the crossed product in the category of Hopf algebras are investigated. Let $A$ and $H$ be two Hopf algebras connected by two morphism of coalgebras $\triangleright : H\ot A \to A$, $f:H\ot H\to A$. The crossed product…
Given a suitable extension $F'/F$ of algebraic function fields over a finite field $\mathbb{F}_q$, we introduce the conorm code $\text{Con}_{F'/F}(\mathcal{C})$ defined over $F'$ which is constructed from an algebraic geometry code…
We introduce a model for directed spatial networks. Starting from an age-based preferential attachment model in which all arcs point from younger to older vertices, we add \emph{reciprocal} connections whose probabilities depend on the age…
The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite…
We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
A construction of covariant quantum phase observables, for Hamiltonians with a finite number of energy eigenvalues, has been recently given by D. Arsenovic et al. [Phys. Rev. A 85, 044103 (2012)]. For Hamiltonians generating periodic…
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…