Related papers: Counting in Uncountably Categorical Pseudofinite S…

We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…

We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".

Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…

The existence of a countably compact group without non-trivial convergent sequences in ZFC alone is a major open problem in topological group theory. We give a ZFC example of a Boolean topological group G without non-trivial convergent…

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

The class of elementary totally disconnected groups is the smallest class of totally disconnected, locally compact, second countable groups which contains all discrete countable groups, all metrizable pro-finite groups, and is closed under…

We consider the compact spaces sigma_n(I) of subsets of an uncountable set I of cardinality at most n and their countable products. We give a complete classification of their Banach spaces of continuous functions and a partial topological…

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

For every uncountable cardinal mu there is a ccc Boolean algebra whose topological density is mu .

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

In this paper, we consider a problem of counting multiplicities. We fix a counting function of multiplicity of rational points in a hypersurface of a projective space over a finite field, and we give an upper bound for the sum with respect…

We study the structure of symplectic quandles, quandles which are also R-modules equipped with an antisymmetric bilinear form. We show that every finite dimensional symplectic quandle over a finite field F or arbitrary field F of…

We show in detail that every compact countable subset of a metric space is homeomorphic to a countable ordinal number, which extends a result given by Mazurkiewicz and Sierpinski for finite-dimensional Euclidean spaces. In order to achieve…

In this note we introduce the notion of a transcendental group, that is, a subgroup $G$ of the topological group $\mathbb{C}$ of all complex numbers such that every element of $G$ except $ 0$ is a transcendental number. All such topological…

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…

Split rank of a rational polyhedron is finite. The well known proof of this is based on the fact that split closure is stronger than the Chv\'{a}tal closure, and the Chv\'{a}tal rank of a rational polyhedron is finite due to the result of…