Related papers: There are no realizable 15_4- and 16_4-configurati…

For each real quadratic field we constructively show the existence of infinitely many exceptional quartic number fields containing that quadratic field. On the other hand, another infinite collection of quartic exceptional fields without…

Kuratowski's 14-set theorem says that in a topological space, 14 is the maximum possible number of distinct sets which can be generated from a fixed set by taking closures and complements. In this article we consider the analogous questions…

We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

In 1990, Branko Gr\"unbaum and John Rigby presented a 4-configuration, known today as the \emph{Gr\"unbaum--Rigby configuration}; it is denoted by $\mathrm{GR}(21_4)$. Independently and earlier, in 1986, Ferenc K\'arteszi published a paper…

Using the invariant developed in [6], we differentiate four arrangements with the same combinatorial information but in different deformation classes. From these arrangements, we construct four other arrangements such that there is no…

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

Let $v_1$,..., $v_n$ be $n$ vectors in an inner product space. Can we find a natural number $d$ and positive (semidefinite) complex matrices $A_1$,..., $A_n$ of size $d \times d$ such that ${\rm Tr}(A_kA_l)= <v_k, v_l>$ for all $k,l=1,...,…

We show that in n-fold cartesian product, n >= 4, a related component need not be a full component. We also prove that when n >= 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1)…

It has been conjectured that the only nets realizable in $\mathbb{CP}^2$ are 3-nets and the Hesse configuration (up to isomorphism). We prove this conjecture.

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…

The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…

A line arrangement of $3n$ lines in $\mathbb CP^2$ satisfies Hirzebruch property if each line intersect others in $n+1$ points. Hirzebruch asked if all such arrangements are related to finite complex reflection groups. We give a positive…

We construct smooth manifolds with order two $\pi_1$ and even intersection forms which are irreducible, meaning they do not decompose into non-trivial connected sums. Their intersection forms being even implies that their universal covers…

In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…