Related papers: A Straightening Theorem for non-Autonomous Iterati…

Motivated by the work of Koornwinder, Macdonald, Cherednik, Noumi, and van Diejen we define a 6-parameter double affine Hecke algebra and establish its basic structural properties, including the existence of an involution. We relate the…

We extend some classical results - such as Quillen's Theorem A, the Grothendieck construction, Thomason's Theorem and the characterisation of homotopically cofinal functors - from the homotopy theory of small categories to polynomial monads…

We generalize and complete some of Maxim's recent results on Alexander invariants of a polynomial transversal to the hyperplane at infinity. Roughly speaking, and surprisingly, such a polynomial behaves both topologically and algebraically…

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

We derive the Taylor polynomial of a function, which is $m$-times continuously differentiable and positive homogeneous of order $m$. The Taylor polynomial in $a$ for $f(b)$ of order $m$ in general is a polynomial of order $m$ in $b-a$. If…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…

Given a perversity function in the sense of intersection homology theory, the method of intersection spaces assigns to certain oriented stratified spaces cell complexes whose ordinary reduced homology with real coefficients satisfies…

According to Noether's theorem the presence of a continuous symmetry in a Hamiltonian systems is equivalent to the existence of a conserved quantity, yet these symmetries are not always explicitly enforced in data-driven models. There…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…

In this paper we prove a compactness theorem for a sequence of harmonic maps which are defined on a converging sequence of Riemannian manifolds.

We consider polynomial systems of Prony type, appearing in many areas of mathematics. Their robust numerical solution is considered to be difficult, especially in "near-colliding" situations. We consider a case when the structure of the…

The property of exponential dichotomy can be seen as a generalization of the hyperbolicity condition for non autonomous linear finite dimensional systems of ordinary differential equations. In 1978 W.A. Coppel proved that the exponential…

The purpose of this article is to study the relation between combinatorial equivalence and topological conjugacy, specifically how a certain type of combinatorial equivalence implies topological conjugacy. We introduce the concept of…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…