Related papers: A short proof for the parameter continuation theor…

We use a classical result of McCord and reduction methods of finite spaces to prove a generalization of Thomason's theorem on homotopy colimits over posets. In particular this allows us to characterize the homotopy colimits of diagrams of…

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

A classical theorem of P. McMullen describes all valuations on polytopes that are invariant under translations and weakly continuous, i.e., continuous with respect to parallel displacements of the facets of a polytope. While it is typically…

Homotopy Brouwer theory is a tool to study the dynamics of surface homeomorphisms. We introduce and illustrate the main objects of homotopy Brouwer theory, and provide a proof of Handel's fixed point theorem. These are the notes of a…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…

We prove a continuous-parameter version of the recent theorem of Katznelson-Tzafiri type for power-bounded operators which have a bounded calculus for analytic Besov functions. We also show that the result can be extended to some operators…

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients…

We prove a persistence result for noncompact normally hyperbolic invariant manifolds in the setting of Riemannian manifolds of bounded geometry. Bounded geometry of the ambient manifold is a crucial assumption required to control the…

To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…

We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.

We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lov\'asz show that many interesting quantities have this form, including, for fixed…

A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…

Lyons' Rough Path theory is currently formulated in p-variation topology. We extend his main-result, the Universal Limit Theorem, to a stronger Hoelder topology. Several approximations to Brownian Rough Paths are studied. As application of…

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

We show that the permanent of a matrix can be written as the expectation value of a function of random variables each with zero mean and unit variance. This result is used to show that Glynn's theorem and a simplified MacMahon theorem…

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…