English
Related papers

Related papers: A General Completeness Theorem for Skip-free Star …

200 papers

We show that symmetry in the vanishing of cohomology holds for graded modules over quantum complete intersections. Moreover, symmetry holds for all modules if the algebra is symmetric.

K-Theory and Homology · Mathematics 2008-11-27 Petter Andreas Bergh

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

Logic · Mathematics 2026-05-07 Alexander Usvyatsov

The representations of a $k$-graph $C^*$-algebra $C^*(\Lambda)$ which arise from $\Lambda$-semibranching function systems are closely linked to the dynamics of the $k$-graph $\Lambda$. In this paper, we undertake a systematic analysis of…

Operator Algebras · Mathematics 2021-02-09 Carla Farsi , Elizabeth Gillaspy , Daniel Gonçalves

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

Rings and Algebras · Mathematics 2021-09-20 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

We prove that if $(X, B+\mathbf{M})$ is a generalized klt pair with $K_X+B+\mathbf{M}_X$ nef and abundant, then $K_X+B+\mathbf{M}_X$ is semiample. More generally, we prove a generalized basepoint free theorem for generalized klt pairs.

Algebraic Geometry · Mathematics 2023-04-18 Priyankur Chaudhuri

Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…

Logic · Mathematics 2026-05-26 Fornasiero Antongiulio , Terzo Giuseppina

We study the tropical dualities and properties of exchange graphs for the totally sign-skew-symmetric cluster algebra under a condition. We prove that the condition always holds for acyclic cluster algebras, then all results hold for the…

Combinatorics · Mathematics 2023-05-02 Siyang Liu

This paper concerns the relation between imperative process algebra and rely/guarantee logic. An imperative process algebra is complemented by a rely/guarantee logic that can be used to reason about how data change in the course of a…

Logic in Computer Science · Computer Science 2025-09-23 C. A. Middelburg

We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…

Formal Languages and Automata Theory · Computer Science 2011-02-24 Zoltan Esik , Werner Kuich

Let $(A, I)$ be a bounded prism, and $X$ be a smooth $p$-adic formal scheme over $\Spf(A/I)$. We consider the notion of crystals on Bhatt--Scholze's prismatic site $(X/A)_{\prism}$ of $X$ relative to $A$. We prove that if $X$ is proper over…

Algebraic Geometry · Mathematics 2023-04-18 Yichao Tian

We give an exposition of results of Baldwin-Shelah on saturated free algebras, at the level of generality of complete first order theories $T$ with a saturated model $M$ which is in the algebraic closure of an indiscernible set. We then…

Logic · Mathematics 2014-10-01 Anand Pillay , Rizos Sklinos

This paper provides a systematization of some recent results in homology of algebras. Our main theorem gives criteria under which the homology of a diagram algebra is isomorphic to the homology of the subalgebra on diagrams having the…

Algebraic Topology · Mathematics 2025-08-26 Guy Boyde

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

Logic · Mathematics 2020-08-25 Friedrich Martin Schneider , Jens Zumbrägel

Pure infiniteness (in sense of E.Kirchberg and M.R{\o}rdam) is considered for C*-algebras arising from singly generated dynamical systems. In particular, Cuntz-Krieger algebras and their generalizations, i.e., graph-algebras and O_A of an…

Operator Algebras · Mathematics 2007-05-23 Jacob v. B. Hjelmborg

The algebra of so-called shifted symmetric functions on partitions has the property that for all elements a certain generating series, called the $q$-bracket, is a quasimodular form. More generally, if a graded algebra $A$ of functions on…

Number Theory · Mathematics 2021-03-17 Jan-Willem M. van Ittersum

In previous definition of $\mathrm{E}$-theory, separability of the $\mathrm{C}^*$-algebras is needed either to construct the composition product or to prove the long exact sequences. Considering the latter, the potential failure of the long…

Operator Algebras · Mathematics 2022-12-15 Christopher Wulff

We investigate the completeness of Gabor systems with respect to several classes of window functions on rational lattices. Our main results show that the time-frequency shifts of every finite linear combination of Hermite functions with…

Mathematical Physics · Physics 2016-11-29 Karlheinz Gröchenig , Antti Haimi , José Luis Romero

We review a notion of completeness in QFT arising from the analysis of basic properties of the set of operator algebras attached to regions. In words, this completeness asserts that the physical observable algebras produced by local degrees…

High Energy Physics - Theory · Physics 2022-01-05 Horacio Casini , Javier M. Magan

We construct and study a graded version of absolute perfectoidization for $G$-graded adic rings. As a main geometric application, we show that the absolute perfectoidization of the structure sheaf of a projective-type formal scheme admits…

Algebraic Geometry · Mathematics 2026-05-12 Ryo Ishizuka , Shou Yoshikawa

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…

Logic in Computer Science · Computer Science 2025-08-22 Nathan Bowler , Sergey Goncharov , Paul Blain Levy
‹ Prev 1 4 5 6 7 8 10 Next ›