Related papers: Norm functors and effective zero cycles

We study branched covers of curves with specified ramification points, under a notion of equivalence derived from linear series. In characteristic 0, no non-constant families of covers with fixed ramification points exist. In positive…

We survey recent work on normal functions, including limits and singularities of admissible normal functions, the Griffiths-Green approach to the Hodge conjecture, algebraicity of the zero-locus of a normal function, Neron models, and…

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 consider a class of two-dimensional functions f(x,y) with the property that the smallness of its rectangular norm implies the smallness of rectangular norm for f(x,x+y). Also we study a family of functions f(x,y) having a similar…

In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…

Cycle integrals of modular functions are expected to play a role in real quadratic analogue of singular moduli. In this paper, we extend the definition of cycle integrals of modular functions from real quadratic numbers to badly…

We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

We study the map associating the cohomology class of an admissible normal function on the product of punctured disks, and give some sufficient conditions for the surjectivity of the map. We also construct some examples such that the map is…

Since categories are graphs with additional "structure", one should start from fuzzy graphs in order to define a theory of fuzzy categories. Thus is makes sense to introduce categories whose morphisms are associated with a plausibility…

We prove the well-definedness of some deformations of the fibred biset category in characteristic zero. The method is to realize the fibred biset category and the deformations as the invariant parts of some categories whose compositions are…

Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…

Systems of germs of sets in infinite-dimensional spaces are introduced and studied. Such a system corresponds to a local zero-set of an ideal of the ring of analytic functions of infinite number of variables. Conversely, this system of…

The definitions and some basic properties of the linear transports along paths in vector bundles and the normal frames for them are recalled. The formalism is specified on line bundles and applied to a geometrical description of the…

We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is…

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

Design patterns are elegant and well-tested solutions to recurrent software development problems. They are the result of software developers dealing with problems that frequently occur, solving them in the same or a slightly adapted way. A…

Let $\mathbb{F}$ be an algebraically closed field of characteristic zero. In this article we show that isotypic blocks of finite groups are functorially equivalent over $\mathbb{F}$.

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…