Quantum RLCRLC circuits: charge discreteness and resonance

In a recent article, we have advanced a semiclassical theory of quantum circuits with discrete charge and electrical resistance. In this work, we present a few elementary applications of this theory. For the zero resistance, inductive circuit, we obtain the Stark ladder energies in yet another way; and generalize earlier results by Chandia et. al, for the circuit driven by a combination d.c. plus a.c. electromotive force (emf). As a second application, we investigate the effect of electrical resistance, together with charge discreteness, in the current amplitude, and resonance conditions of a general $RLC$ quantum circuit, including nonlinear effects up to third order on the external sinusoidal emf

A viewpoint on amalgamation classes

We provide a self-contained introduction to the classical theory of universal-homogeneous models (also known as generic structures, rich models, or Fra\"iss\'e limits). In the literature, most treatments restrict consideration to embeddings among finite structures. This is not suitable for some applications. We take the notion of morphisms as primitive and we allow structures to have arbitrary cardinality

Some applications of the ultrapower theorem to the theory of compacta

The ultrapower theorem of Keisler-Shelah allows such model-theoretic notions as elementary equivalence, elementary embedding and existential embedding to be couched in the language of categories (limits, morphism diagrams). This in turn allows analogs of these (and related) notions to be transported into unusual settings, chiefly those of Banach spaces and of compacta. Our interest here is the enrichment of the theory of compacta, especially the theory of continua, brought about by the immigration of model-theoretic ideas and techniques

The complexity of classification problems for models of arithmetic

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.Comment: 15 page

Formalized linear algebra over Elementary Divisor Rings in Coq

This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support essential operations of linear algebra, the classification theorem of finitely presented modules over such rings and the uniqueness of the Smith normal form up to multiplication by units. We present formally verified algorithms computing this normal form on a variety of coefficient structures including Euclidean domains and constructive principal ideal domains. We also study different ways to extend B\'ezout domains in order to be able to compute the Smith normal form of matrices. The extensions we consider are: adequacy (i.e. the existence of a gdco operation), Krull dimension $\leq 1$ and well-founded strict divisibility

Some Applications of the Ultrapower Theorem to the Theory of Compacta

The ultrapower theorem of Keisler and Shelah allows such model-theoretic notions as elementary equivalence, elementary embedding and existential embedding to be couched in the language of categories (limits, morphism diagrams). This in turn allows analogs of these (and related) notions to be transported into unusual settings, chiefly those of Banach spaces and of compacta. Our interest here is the enrichment of the theory of compacta, especially the theory of continua, brought about by the importation of model-theoretic ideas and techniques