相关论文: Numberings and randomness

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

Multi-label Classification (MLC) assigns an instance to one or more non-exclusive classes. A challenge arises when the dataset contains a large proportion of instances with no assigned class, referred to as negative data, which can…

We show that degrees containing a complete extensions of arithmetic have the random join property: they are the supremum of any random real they compute, with another random real. The same is true for the truth-table and weak truth-table…

Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…

We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families.…

We design an algorithm for computing the $L$-series associated to an Anderson $t$-motives, exhibiting quasilinear complexity with respect to the target precision. Based on experiments, we conjecture that the order of vanishing at $T=1$ of…

We study $\ell^2$ Betti numbers, coherence, and virtual fibring of random groups in the few-relator model. In particular, random groups with negative Euler characteristic are coherent, have $\ell^2$ homology concentrated in dimension 1, and…

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…

In this paper we consider the distribution of the zeros of a real random Bargmann-Fock function of one or more variables. For these random functions we prove estimates for two types of families of events, both of which are large deviations…

Ordinal categorical data are widely collected in psychology, education, and other social sciences, appearing commonly in questionnaires, assessments, and surveys. Latent class models provide a flexible framework for uncovering unobserved…

Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…

We introduce the notion of weakly (strongly) infinite real rank for unital $C^{\ast}$-algebras. It is shown that a compact space $X$ is weakly (strongly) infine-dimensional if and only if $C(X)$ has weakly (strongly) infinite real rank.…

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every…

Let $F$ be a set-valued mapping from an $N$-element metric space $({\mathcal M},\rho)$ into the family of all closed half-planes in ${\bf R}^2$. In this paper, we provide an efficient algorithm for a Lipschitz selection of $F$, i.e., a…

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…

We show that the family of nest algebras with $r$ non-zero nest projections is stable, in the sense that an approximate containment of one such algebra within another is close to an exact containment. We use this result to give a local…

Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…

We consider the relationship between learnability of a "base class" of functions on a set $X$, and learnability of a class of statistical functions derived from the base class. For example, we refine results showing that learnability of a…

Given a closed ideal $I$ in a C*-algebra $A$, we develop techniques to bound the real rank of $A$ in terms of the real ranks of $I$ and $A/I$. Building on work of Brown, Lin and Zhang, we obtain complete solutions if $I$ belongs to any of…