Related papers: A note on ordinal exponentiation and derivatives o…
A natural model of read-once linear branching programs is a branching program where queries are $\mathbb{F}_2$ linear forms, and along each path, the queries are linearly independent. We consider two restrictions of this model, which we…
In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…
One-parameter natural exponential family (NEF) plays fundamental roles in probability and statistics. This article contains two independent results: (a) A conjecture of Bar-Lev, Bshouty and Enis states that a polynomial with a simple root…
We prove that if D is a domain in C, alpha>1 and c>0, then the family F of functions meromorphic in D such that |f'(z)|/(1+|f(z)|^alpha)>c for every z in D is normalin D. For alpha=1, the same assumptions imply quasi-normality but not…
For families of smooth complex projective varieties we show that normal functions arising from algebraically trivial cycle classes are algebraic, and defined over the field of definition of the family. In particular, the zero loci of those…
Let $ x = [0;a_1,a_2,...]$ be the decomposition of the irrational number $x \in [0,1]$ into regular continued fraction. Then for the derivative of the Minkowski function $?(x)$ we prove that $?'(x) = +\infty$ provided $ \limsup_{t\to…
It is well known that all numbers that are normal of order $k$ in base $b$ are also normal of all orders less than $k$. Another basic fact is that every real number is normal in base $b$ if and only if it is simply normal in base $b^k$ for…
There are two major generalizations of the standard ordinal analysis: One is Girard's $\Pi^1_2$-proof theory in which dilators are assigned to theories instead of ordinals. The other is Pohlers' generalized ordinal analysis with Spector…
We consider the class of all non-negative on $\mathbb{R_+}$ functions such that each of them satisfies the Reverse H\"older Inequality uniformly over all intervals with some constant the minimum value of which can be regarded as the…
If there is a topologically locally constant family of smooth algebraic varieties together with an admissible normal function on the total space, then the latter is constant on any fiber if this holds on some fiber. Combined with spreading…
We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…
We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…
We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations $X_1,\dots, X_n$ in a separable Hilbert space $\mathbb{H}$ with unknown covariance operator $\Sigma.$ The complexity of the problem is characterized by…
Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity. The language of Reflection Calculus RC consists of…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
Brouwer-operations, also known as inductively defined neighbourhood functions, provide a good notion of continuity on Baire space which naturally extends that of uniform continuity on Cantor space. In this paper, we introduce a continuity…
We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
$\Omega$-rule was introduced by W. Buchholz to give an ordinal-free cut-elimination proof for a subsystem of analysis with $\Pi^{1}_{1}$-comprehension. His proof provides cut-free derivations by familiar rules only for arithmetical…
In this paper the Mittag-Leffler function is given through the exponential functions for any rational derivatives of m/n order, where m<n, n>1 are natural irreducible numbers (if n=1 then m is also equal to unity). Unlike the previous…