Related papers: A General Theory of Pointlike Sets
We study algebraicity and smoothness of fixed point stacks for flat group schemes which have a finite composition series whose factors are either reductive or proper, flat, finitely presented, acting on algebraic stacks with affine,…
We introduce the notion of a Lie superheaps as a generalisation of Lie supergroups. We show that the well-known `groupification' and `heapification' functors generalise to the ambience of supergeometry. In particular, we show that there is…
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…
Using functional equations, we define functors that generalize standard examples from calculus of one variable. Examples of such functors are discussed and their Taylor towers are computed. We also show that these functors factor through…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
A functorial semi-norm on singular homology is a collection of semi-norms on the singular homology groups of spaces such that continuous maps between spaces induce norm-decreasing maps in homology. Functorial semi-norms can be used to give…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
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…
In this paper, we introduce a new class of implicit function to prove common fixed point theorems in fuzzy metric space. Moreover we define a new altering distance in terms of integral and utilize the same to deduce integral type…
Under suitable hypotheses, we prove that a form of a projective homogeneous variety $G/P$ defined over the function field of a surface over an algebraically closed field has a rational point. The method uses an algebro-geometric analogue of…
We begin with a short exposition of the theory of lattice varieties. This includes a description of their orbit structure and smooth locus. We construct a flat cover of the lattice variety and show that it is a complete intersection. We…
In this paper, we introduce the concepts of m-quasiconvex, originally m-quasiconvex,and generalized m-quasiconvex functionals on topological vector spaces. Then we extend the concept of point separable topological vector spaces (by the…
Two new generalizations of the relation of comonotonicity of lattice-valued vectors are introduced and discussed. These new relations coincide on distributive lattices and they share several properties with the comonotonicity for the…
We define a notion of Morse function and establish Morse theory-like theorems over offsets of any compact set in a Euclidean space at regular values of their distance function. Using non-smooth analysis and tools from geometric measure…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…