Related papers: Log adjunction: moduli part
In this short note we reduce the b-semiampleness conjecture for lc-trivial fibrations to the b-semiampleness conjecture for klt-trivial fibrations.
We study moduli spaces of maximal orders in a ramified division algebra over the function field of a smooth projective surface. As in the case of moduli of stable commutative surfaces, we show that there is a Koll\'ar-type condition giving…
In this expository article, we will give an efficient functorial proof of the equivalence of various characterisations of purity in a finitely accessible additive category $\mathcal C$. The complications of the proofs for specific choices…
We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.
The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…
For locally compact Hausdorff spaces $X$ and $Y$, and function algebras $A$ and $B$ on $X$ and $Y$, respectively, surjections $T:A \longrightarrow B$ satisfying norm multiplicative condition $\|Tf\, Tg\|_Y =\|fg\|_X$, $f,g\in A$, with…
Multi-adjoint logic programming is a general framework with interesting features, which involves other positive logic programming frameworks such as monotonic and residuated logic programming, generalized annotated logic programs, fuzzy…
P. Aluffi introduced in [1] a new graded algebra in order to conveniently express characteristic cycles in the theory of singular varieties. This algebra is attached to a surjective ring homomorphism $A\surjects B$ by taking a suitable…
Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to…
In this paper we investigate the asymptotic growth of the number of irreducible and connected components of the moduli space of surfaces of general type corresponding to certain families of surfaces isogenous to a higher product with group…
Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
We characterize the regularity of an FI-module using the derivative functors.
Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…
As left adjoint to the dual algebra functor, Sweedler's finite dual construction is an important tool in the theory of Hopf algebras over a field. We show in this note that the left adjoint to the dual algebra functor, which exists over…
Proof assistants play a dual role as programming languages and logical systems. As programming languages, proof assistants offer standard modularity mechanisms such as first-class functions, type polymorphism and modules. As logical…
The purpose of these notes is to give a categorical semantics for the transpension type (Nuyts and Devriese, Transpension: The Right Adjoint to the Pi-type, Accepted at LMCS, 2024), which is right adjoint to a potentially substructural…
A method of constructing (finitely generated and projective) right module structure on a finitely generated projective left module over an algebra is presented. This leads to a construction of a first order differential calculus on such a…
We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…