English
Related papers

Related papers: Varieties with Definable Factor Congruences

200 papers

Let $X$ be a smooth variety over a finite field $\mathbb{F}_q$. Let $\ell$ be a rational prime number invertible in $\mathbb{F}_q$. For an $\ell$-adic sheaf $\mathcal{F}$ on $X$, we construct a cycle supported on the singular support of…

Algebraic Geometry · Mathematics 2026-04-06 Daichi Takeuchi

Generalizing deformation quantizations with separation of variables of a K\"ahler manifold $M$, we adopt Fedosov's gluing argument to construct a category $\mathsf{DQ}$, enriched over sheaves of $\mathbb{C}[[\hbar]]$-modules on $M$, as a…

Symplectic Geometry · Mathematics 2024-11-22 YuTung Yau

Let $X$ be a quasi-compact and quasi-separated scheme. There are two fundamental and pervasive facts about the unbounded derived category of $X$: (1) $\mathsf{D}_{\mathrm{qc}}(X)$ is compactly generated by perfect complexes and (2) if $X$…

Algebraic Geometry · Mathematics 2015-12-04 Jack Hall , Amnon Neeman , David Rydh

The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP theorem shows that strong models like linearizability…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-29 Hagit Attiya , Constantin Enea , Enrique Román-Calvo

The positive definiteness of real quadratic forms with convolution structures plays an important role in stability analysis for time-stepping schemes for nonlocal operators.In this work, we present a novel analysis tool to handle discrete…

Numerical Analysis · Mathematics 2023-11-23 Hong-lin Liao , Tao Tang , Tao Zhou

We develop the theory of Hopf bimodules for a finite rigid tensor category C. Then we use this theory to define a distinguished invertible object D of C and an isomorphism of tensor functors ?^{**} and D tensor ^{**}? tensor D^{-1}. This…

Quantum Algebra · Mathematics 2009-05-19 Pavel Etingof , Dmitri Nikshych , Viktor Ostrik

The purpose of this note is to consider in detail the construction of derived functors. The classical construction, such as in Cartan-Eilenberg or Grothendieck, is clarified, and it is shown, at the same time, that everything can be…

Category Theory · Mathematics 2025-04-02 João Schwarz

Pairwise causal background knowledge about the existence or absence of causal edges and paths is frequently encountered in observational studies. Such constraints allow the shared directed and undirected edges in the constrained subclass of…

Artificial Intelligence · Computer Science 2026-01-06 Zhuangyan Fang , Ruiqi Zhao , Yue Liu , Yangbo He

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

We prove that for log canonical foliations which are birationally bounded by algebraically integrable families, the set of their volumes satisfies the DCC. This answers a special case of a question posed by Cascini, Hacon, and Langer. As a…

Algebraic Geometry · Mathematics 2025-12-29 Zhixiu Fan

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.

Logic · Mathematics 2010-11-11 Pedro Sánchez Terraf

Ardakov-Wadsley defined the sheaf D-cap of $p$-adic analytic differential operators on a smooth rigid analytic variety $X$ by restricting to the case where $X$ is affinoid and the tangent sheaf admits a smooth Lie lattice. We generalize…

Number Theory · Mathematics 2019-09-04 Andreas Bode

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

Numerical Analysis · Mathematics 2025-08-26 Oleg Davydov

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

Auslander's formula shows that any abelian category C is equivalent to the category of coherent functors on C modulo the Serre subcategory of all effaceable functors. We establish a derived version of this equivalence. This amounts to…

Category Theory · Mathematics 2015-06-16 Henning Krause

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

Logic · Mathematics 2013-04-04 Mohammed Assem , Tarek Sayed Ahmed

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…

Rings and Algebras · Mathematics 2014-03-31 Pierre Gillibert , Miroslav Ploscica

We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…

Logic in Computer Science · Computer Science 2025-10-31 Salvador Lucas