Related papers: Notions of indifference for genericity: Union and …
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{g_1,\ldots,g_n\}\subset G$ is universal, i.e if the closure $\overline{<\mathcal{S}>}$ is equal to $G$, where $G$ is either the special unitary or the…
We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…
A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…
In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…
Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…
Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…
We introduce and analyze the following general concept of recurrence. Let $G$ be a group and let $X$ be a G-space with the action $G\times X\longrightarrow X$, $(g,x)\longmapsto gx$. For a family $\mathfrak{F}$ of subset of $X$ and $A\in…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…
The purpose of this note is to describe a space that is regular but not completely regular, but only barely so: all closed sets are $G_\delta$-sets and every singleton is a zero-set.
We show that every null-additive set is meager-additive, where: (1) a set X subseteq 2^omega is null-additive if for every Lebesgue null set A subseteq 2^omega, X+A is null too; (2) we say that X subseteq 2^omega is meager-additive if for…
In this paper, a generalized version of the von Neumann universe known as the total universe is proposed to formally introduce non-well-founded sets that include infinitons, semi-infinitons and quasi-infinitons in Russell's paradox. All…
A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…
Let $x$ be a sequence taking values in a separable metric space and $\mathcal{I}$ be a generalized density ideal or an $F_\sigma$-ideal on the positive integers (in particular, $\mathcal{I}$ can be any Erd{\H o}s--Ulam ideal or any summable…
We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…
A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…
We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…