Related papers: Randomness and semigenericity
The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…
This paper studies averaging algebras, say, associative algebras endowed with averaging operators. We develop a cohomology theory for averaging algebras and justify it by interpreting lower degree cohomology groups as formal deformations…
We define the notion of an almost polynomial identity of an associative algebra $R$, and show that its existence implies the existence of an actual polynomial identity of $R$. A similar result is also obtained for Lie algebras and Jordan…
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…
We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coin that outputs "true" with probability p, we have that the…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative…
Let $\Lambda$ be an artin algebra and $X$ a finitely generated $\Lambda$-module. Iyama has shown that there exists a module $Y$ such that the endomorphism ring $\Gamma$ of $X\oplus Y$ is quasi-hereditary, with a heredity chain of length…
Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…
Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…
A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We study extensively the homotopy theory of coalgebras. By coalgebras, we mean the full theory of coalgebras: with counits and not necessarily locally conilpotent. For example $\mathcal E_\infty$-coalgebras, $\mathcal A_\infty$-coalgebras,…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…
It is a well-known fact in K-theory that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We…
Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…