Related papers: Independence and Induction in Reverse Mathematics
We call shifted power a polynomial of the form $(x-a)^e$. The main goal of this paper is to obtain broadly applicable criteria ensuring that the elements of a finite family $F$ of shifted powers are linearly independent or, failing that, to…
Let $T$ be a $C^{1}$ competitive map on a rectangular region $R\subset \mathbb{R}^{2}$. The main results of this paper give conditions which guarantee the existence of an invariant curve $C$, which is the graph of a continuous increasing…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
Conditional independence and graphical models are well studied for probability distributions on product spaces. We propose a new notion of conditional independence for any measure $\Lambda$ on the punctured Euclidean space $\mathbb…
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-founded sets and iterated induction. In this work, we define a logic formalizing…
We consider a class of tempered subordinators, namely a class of subordinators with one-dimensional marginal tempered distributions which belong to a family studied in [3]. The main contribution in this paper is a non-central moderate…
For $\mu, \kappa$ infinite, say $\mathcal{A}\subseteq [\kappa]^\kappa$ is a $(\mu,\kappa)$-maximal independent family if whenever $\mathcal{A}_0$ and $\mathcal{A}_1$ are pairwise disjoint non-empty in $[\mathcal{A}]^{<\mu}$ then…
This paper contains a partial result on the Pierce--Birkhoff conjecture on piece-wise polynomial functions defined by a finite collection {f 1,. .., f r} of polynomials. In the nineteen eighties, generalizing the problem from the polynomial…
Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…
We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…
We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…
There are now many theoretical explanations for why Benford's law of digit bias surfaces in so many diverse fields and data sets. After briefly reviewing some of these, we discuss in depth recurrence relations. As these are discrete…
A directed acyclic graph (DAG) partially represents the conditional independence structure among observations of a system if the local Markov condition holds, that is, if every variable is independent of its non-descendants given its…
In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…
Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
We investigate some variants of the splitting, reaping, and independence numbers defined using asymptotic density. Specifically, we give a proof of Con($\mathfrak{i}<\mathfrak{s}_{1/2}$), Con($\mathfrak{r}_{1/2}<\mathfrak{b}$) and…
We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families,…