Related papers: A first-countable non-remainder of H
Let $p$ be a large prime, and let $k\ll \log p$. A new proof of the existence of any pattern of $k$ consecutive quadratic residues and quadratic nonresidues is introduced in this note. Further, an application to the least quadratic…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
In this paper we give the first examples of positive closed currents in $\mathbb{C}^2$ with continuous potentials, vanishing self-intersection, and which are not laminar. More precisely, they are supported on sets "without analytic…
We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…
It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be…
Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…
Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels…
In this review we discuss the persistence and the related first-passage properties in extended many-body nonequilibrium systems. Starting with simple systems with one or few degrees of freedom, such as random walk and random acceleration…
In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and…
An example of a cocomplete abelian category that is not complete is constructed.
Absolute continuity implies uniform continuity, but generally not vice versa. In this short note, we present one sufficient condition for a uniformly continuous function to be absolutely continuous, which is the following theorem: For a…
We show that the real line R viewed as a vector space is of uncountable (algebraic) dimension over the scalar field Q of rational numbers. We then build an operator J which maps {R, Q} onto {R, Q}, is Q-linear and whose graph is scattered…
We construct the first example of a lattice on an irreducible Euclidean building that is not residually finite. Conjecturally, the normal subgroup theorem extends to this lattice making it virtually simple.
CWH, CWN stand for collectionwise Hausdorff and collectionwise normal respectively. We analyze the statement "there is a lambda-CWH not CWH first countable (Hausdorff topological) space". We prove the existence of such a space under various…
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…