Related papers: Proper Functors and Fixed Points for Finite Behavi…
A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
By restricting the variables running over various (possibly different) subfields, we introduce the notion of a partial zeta function. We prove that the partial zeta function is rational in an interesting case, generalizing Dwork's well…
Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…
In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.
A new technique for proving fixed point theorems for families of holomorphic transformations of operator balls is developed. One of these theorems is used to show that a bounded representation in a real or complex Hilbert space is…
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…
For an arbitrary category, we consider the least class of functors con- taining the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of…
A toral algebraic set $A$ is an algebraic set in $\C^n$ whose intersection with $\T^n$ is sufficiently large to determine the holomorphic functions on $A$. We develop the theory of these sets, and give a number of applications to function…
A functional Menger $\cap$-algebra is a set of n-place functions containing n projections and closed under the so-called Menger's compositions of n-place functions and the set-theoretic intersection of functions. We give the abstract…
We systematically develop the theory of definable functors between compactly generated triangulated categories. Such functors preserve pure triangles, pure injective objects, and definable subcategories, and as such appear in a wide range…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…