Related papers: Infinite Lexicographic Products
We classify all continuous tensor product systems of Hilbert spaces which are ``infinitely divisible" in the sense that they have an associated logarithmic structure. These results are applied to the theory of E_0 semigroups to deduce that…
Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…
Using the fusion product of the representations of the Lie algebra $\mathfrak{sl}_2$ we construct a set of the integrable highest weight $\hat{\mathfrak{sl}_2}$-modules $L^D$, depending on the vector $D\in\mathbb{N}^{k+1}$. In a special…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
In this paper we introduce the concept of infinite pointwise dense lineability (spaceability), and provide a criterion to obtain density from mere lineability. As an application, we study the linear and topological structures within the set…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
A genuine infinite tensor product of complex vector spaces is a vector space ${\bigotimes}_{i\in I} X_i$ whose linear maps coincide with multilinear maps on an infinite family $\{X_i\}_{i\in I}$ of vector spaces. We give a direct sum…
It is known that the spatial product of two product systems is intrinsic. Here we extend this result by analyzing subsystems of the tensor product of product systems. A relation with cluster systems is established. In a special case, we…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the partition. We show that for any countable subset of the positive…
Recently, it has been shown constructively how a finite set of hypergeometric products, multibasic hypergeometric products or their mixed versions can be modeled properly in the setting of formal difference rings. Here special emphasis is…
Let $G$ be a residually finite group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in $X$. The…
A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…
On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…
The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…
Let $A\subseteq B$ be a $C^*$-inclusion. We give efficient conditions under which $A$ separates ideals in $B$, and $B$ is purely infinite if every positive element in $A$ is properly infinite in $B$. We specialise to the case when $B$ is a…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
Uncountably many mutually non-isomorphic product systems (that is, continuous tensor products of Hilbert spaces) of types II-0 and III are constructed by probabilistic means (random sets and off-white noises), answering four questions of W.…
The method of direct computation of universal (fibred) product in the category of commutative associative algebras of finite type with unity over a field is given and proven. The field of coefficients is not supposed to be algebraically…