Related papers: An elementary proof of the halting property for Ch…
We present a new `elementary' proof of the irrationality of $\zeta(3)$ based on some recent `hypergeometric' ideas of Yu.Nesterenko, T.Rivoal, and K.Ball, and on Zeilberger's algorithm of creative telescoping.
Let $A$ be a pseudo-differential operator with negative definite symbol $q$. In this paper we establish a sufficient condition such that the well-posedness of the $(A,C_c^{\infty}(\mathbb{R}^d))$-martingale problem implies that the unique…
Arzel\`a's bounded convergence theorem (1885) states that if a sequence of Riemann integrable functions on a closed interval is uniformly bounded and has an integrable pointwise limit, then the sequence of their integrals tends to the…
We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…
An even (respectively, odd) hole in a graph is an induced cycle with even (respectively, odd) length that is at least four. Bienstock [DM 1991 and 1992] proved that detecting an even (respectively, odd) hole containing a given vertex is…
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
Let $X= \mathbb{P}^1 \setminus \{0,1,\infty\}$, and let $S$ denote a finite set of prime numbers. In an article of 2005, Minhyong Kim gave a new proof of Siegel's theorem for $X$: the set $X(\mathbb{Z}[S^{-1}])$ of $S$-integral points of…
We develop a continuation technique to obtain global families of stable periodic orbits, delimited by transcritical bifurcations at both ends. To this end, we formulate a zero-finding problem whose zeros correspond to families of periodic…
Precedence constraints are inequalities used to model time dependencies. In 1958, Gallai proved that a finite system of precedence constraints admits solutions if and only if the corresponding precedence graph does not contain…
The fact that the null generators of a future Cauchy horizon are past complete was proved first by Hawking and Ellis [1]. Then Budzy\'nski, Kondracki, and Kr\'olak outlined a proof free from an error found in the original one [2]. Finally,…
We extend Goldie's implicit renewal theorem to the arithmetic case, which allows us to determine the tail behavior of the solution of various random fixed point equations. It turns out that the arithmetic and nonarithmetic cases are very…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical…
The notion of the capacity of a polynomial was introduced by Gurvits around 2005, originally to give drastically simplified proofs of the Van der Waerden lower bound for permanents of doubly stochastic matrices and Schrijver's inequality…
In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…
In this paper, a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm is provided, utilizing the celebrated Zangwill convergence theorem. It is shown that the iterative sequence generated by SPCM…
When the term ``black hole'' was originally coined in 1968, it was immediately conjectured that the only pure vacuum equilibrium states were those of the Kerr family. Efforts to confirm this made rapid progress during the ``classical…
A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…