Related papers: Problems with fixpoints of polynomials of polynomi…
In a previous paper the authors elaborated notions and technique which could be applied to compute such invariants of polynomials as Euler characteristics of fibres and zeta-functions of monodromy transformations associated with a…
One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…
In this paper we propose unifying the categories of cochain complexes $\text{Ch}(\mathcal{C})$ and modules $\widehat{A}\text{-mod}$ over a repetitive algebra $\widehat{A}$. Motivated by their striking similarities and importance, we…
We give structural results about bifibrations of (internal) $(\infty,1)$-categories with internal sums. This includes a higher version of Moens' Theorem, characterizing cartesian bifibrations with extensive aka stable and disjoint internal…
We study the fixed point subalgebra of a certain class of lattice vertex operator algebras by an automorphism of order 3, which is a lift of a fixed-point-free isometry of the underlying lattice. We classify the irreducible modules for the…
We study projective completions of affine algebraic varieties which are given by filtrations, or equivalently, 'degree like functions' on their rings of regular functions. For a quasifinite polynomial map P (i.e. with all fibers finite) of…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
Given a DG-category A we introduce the bar category of modules Modbar(A). It is a DG-enhancement of the derived category D(A) of A which is isomorphic to the category of DG A-modules with A-infinity morphisms between them. However, it is…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity…
The tensor functor called $\alpha$-induction arises from a Frobenius algebra object, or a Q-system, in a braided unitary fusion category. In the operator algebraic language, it gives extensions of endomorphism of $N$ to $M$ arising from a…
Many applications of fusion categories, particularly in physics, require the associators or $F$-symbols to be known explicitly. Finding these matrices typically involves solving vast systems of coupled polynomial equations in large numbers…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
Using Poincar\'e duality in K-theory, we state and prove a Lefschetz fixed point formula for endomorphisms of cross product C*-algebras $C_0(X)\cross G$ coming from covariant pairs. Here $G$ is assumed countable, $X$ a manifold, and…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
In this paper, we study the arithmetic zeta function $$\mathscr{Z}_{\mathcal{X}}(s) = \prod_p \prod_{\substack{x \in \mathcal{X}_p \\ \text{closed}}} \Big( \frac{1}{1-|\kappa(x)|^{-s}} \Big)^{\mathfrak{m}_{p}(x)}$$ associated to a scheme…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound…