In this monograph, we lay the foundations for a new theory that generalizes real algebraic geometry. Let $R|K$ be a field extension, where $R$ is a real closed field and $K$ is an ordered subfield of $R$. The main objective is to study $K$-algebraic subsets of $R^n$, i.e., those subsets of $R^n$ that are the zero loci of polynomials with coefficients in $K$. Real algebraic geometry already covers the case when $K$ is also a real closed field. Our goal is to extend real algebraic geometry to the case when $K$ is not real closed, for example when $K$ is the field $\mathbb{Q}$ of rational numbers. Several new geometric phenomena appear. There is no complex counterpart to this generalized real algebraic geometry. The reason is as follows. If $C|K$ is a field extension with $C$ algebraically closed and $X$ is a $K$-algebraic subset of $C^n$, then Hilbert's Nullstellensatz implies that the ideal of polynomials with coefficients in $C$ that vanish on~$X$ is generated by the ideal of polynomials with coefficients in $K$ that vanish on $X$. In the real realm, this is false in general, for example when we consider field extensions $R|K$ with $R$ real closed and $K=\mathbb{Q}$. This monograph also presents some applications of the theory developed. Here is an example. The celebrated Nash-Tognoli theorem states that every compact smooth manifold $M$ is diffeomorphic to a nonsingular real algebraic set $M'$, called algebraic model of $M$. The theory developed here provides the theoretical basis to prove that the algebraic model $M'$ of $M$ can be chosen to be $\mathbb{Q}$-algebraic and $\mathbb{Q}$-nonsingular. This guarantees for the first time that, up to smooth diffeomorphisms, every compact smooth manifold can be encoded both globally and locally involving only finitely many exact data.

Strongly robust toric ideals are the toric ideals for which the set of indispensable binomials is the Graver basis. The strongly robust simplicial complex $\Delta _T$ of a simple toric ideal $I_T$ determines the strongly robust property for all toric ideals that have $I_T$ as their bouquet ideal. We prove that \text{dim} \Delta_T<\text{rank}(T) for configurations in general position, partially answering a question posed by Sullivant.

We show a certain existence of a lifting of modules under the self-$\mathrm{Ext}^2$-vanishing condition over the "derived quotient" by using the notion of higher algebra. This refines a work of Auslander-Ding-Solberg's solution of the Auslander-Reiten conjecture for complete interesctions. Together with Auslander's zero-divisor theorem, we show that the existence of such $\mathrm{Ext}$-vanishing module over derived quotients is equivalent to being local complete intersections.

To every toric ideal one can associate an oriented matroid structure, consisting of a graph and another toric ideal, called bouquet ideal. The connected components of this graph are called bouquets. Bouquets are of three types; free, mixed and non mixed. We prove that the cardinality of the following sets - the set of indispensable elements, minimal Markov bases, the Universal Markov basis and the Universal Gröbner basis of a toric ideal - depends only on the type of the bouquets and the bouquet ideal. These results enable us to introduce the strongly robustness simplicial complex and show that it determines the strongly robustness property. For codimension 2 toric ideals, we study the strongly robustness simplicial complex and prove that robustness implies strongly robustness.

We develop the algebraic formalism of the formal ternary laws of C. Walter and we compare them to Buchstaber's 2-valued formal group laws. We also compute the "elementary" formal ternary laws (after inverting 2) using a computer program available online.

We define nice partitions of the multicomplex associated to a Stanley ideal. As the main result we show that if the monomial ideal $I$ is a CM Stanley ideal, then $I^p$ is a Stanley ideal as well, where $I^p$ is the polarization of $I$.

Let $A$ be a Noetherian ring of dimension $d$ and let $\mathcal{D}^b(A)$ be the bounded derived category of $A$. Let $\mathcal{D}_i^b(A)$ denote the thick subcategory of $\mathcal{D}^b(A)$ consisting of complexes $\mathbf{X}_\bullet$ with $\dim H^n(\mathbf{X}_\bullet) \leq i$ for all $n$. Set $\mathcal{D}_{-1}^b(A) = 0$. Consider the Verdier quotients $\mathcal{C}_i(A) = \mathcal{D}_i^b(A)/\mathcal{D}_{i-1}^b(A)$. We show for $i = 0, \ldots, d$, $\mathcal{C}_i(A)$ is a Krull-Remak-Schmidt triangulated category with a bounded $t$-structure. We identify its heart. We also prove that if $A$ is regular then $\mathcal{C}_i(A)$ has AR-triangles. We also prove that $$\mathcal{C}_i(A) \cong \bigoplus_{\stackrel{P}{\dim A/P = i}} \mathcal{D}_0^b(A_P).$$

Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite topologies, associative algebras, subgroups of matrix groups, ideals in polynomial rings, and classes of bipartite graphs.

Tame arrangements were informally introduced by Orlik and Terao for the study of Milnor fibers of hyperplane arrangements. After that, tame arrangements have been applied to a lot of researches on arrangements including freeness, master functions and critical varieties, Solomon-Terao algebras, D-modules, Bernstein-Sato polynomials and likelihood geometry. Though arrangements are generically tame, the research on tame arrangements themselves have been only few. In this article we establish foundations for the research of tame arrangements. Namely, we prove the addition theorem for tame arrangements, Ziegler-Yoshinaga type results for tameness and combinatorially determined tameness.

In this paper, we give a new criterion for the Cohen-Macaulayness of vertex splittable ideals, a family of monomial ideals recently introduced by Moradi and Khosh-Ahang. Our result relies on a Betti splitting of the ideal and provides an inductive way of checking the Cohen-Macaulay property. As a result, we obtain characterizations for Gorenstein, level and pseudo-Gorenstein vertex splittable ideals. Furthermore, we provide new and simpler combinatorial proofs of known Cohen-Macaulay criteria for several families of monomial ideals, such as (vector-spread) strongly stable ideals and (componentwise) polymatroidals. Finally, we characterize the family of bi-Cohen-Macaulay graphs by the novel criterion for the Cohen-Macaulayness of vertex splittable ideals.

Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in this context. In addition we discuss some implementation and complexity issues. The main motivation comes from tropical geometry, as tropical varieties can be defined using these Groebner bases, but we also give examples showing that the resulting Groebner bases can be substantially smaller than traditional Groebner bases. In the case K = Q with the p-adic valuation the algorithms have been implemented in a Macaulay 2 package.

We review the theory of almost coherent modules that was introduced in "Almost Ring Theory" by Gabber and Ramero. Then we globalize it by developing a new theory of almost coherent sheaves on schemes and on a class of "nice" formal schemes. We show that these sheaves satisfy many properties similar to usual coherent sheaves, i.e. the Almost Proper Mapping Theorem, the Formal GAGA, etc. We also construct an almost version of the Grothendieck twisted image functor $f^!$ and verify its properties. Lastly, we study sheaves of $p$-adic nearby cycles on admissible formal models of rigid spaces and show that these sheaves provide examples of almost coherent sheaves. This gives a new proof of the finiteness result for \'etale cohomology of proper rigid spaces obtained before in the work of Peter Scholze "$p$-adic Hodge Theory For Rigid-Analytic Varieties".

Since 1883, Picard-Vessiot theory had been developed as the Galois theory of differential field extensions associated to linear differential equations. Inspired by categorical Galois theory of Janelidze, and by using novel methods of precategorical descent applied to algebraic-geometric situations, we develop a Galois theory that applies to morphisms of differential schemes, and vastly generalises the linear Picard-Vessiot theory, as well as the strongly normal theory of Kolchin.

Gr\"obner bases are an important tool in computational algebra and, especially in cryptography, often serve as a boilerplate for solving systems of polynomial equations. Research regarding (efficient) algorithms for computing Gr\"obner bases spans a large body of dedicated work that stretches over the last six decades. The pioneering work of Bruno Buchberger in 1965 can be considered as the blueprint for all subsequent Gr\"obner basis algorithms to date. Among the most efficient algorithms in this line of work are signature-based Gr\"obner basis algorithms, with the first of its kind published in the late 1990s by Jean-Charles Faug\`ere under the name F5. In addition to signature-based approaches, Rusydi Makarim and Marc Stevens investigated a different direction to efficiently compute Gr\"obner bases, which they published in 2017 with their algorithm M4GB. The ideas behind M4GB and signature-based approaches are conceptually orthogonal to each other because each approach addresses a different source of inefficiency in Buchberger's initial algorithm by different means. We amalgamate those orthogonal ideas and devise a new Gr\"obner basis algorithm, called M5GB, that combines the concepts of both worlds. In that capacity, M5GB merges strong signature-criteria to eliminate redundant S-pairs with concepts for fast polynomial reductions borrowed from M4GB. We provide proofs of termination and correctness and a proof-of-concept implementation in C++ by means of the Mathic library. The comparison with a state-of-the-art signature-based Gr\"obner basis algorithm (implemented via the same library) validates our expectations of an overall faster runtime for quadratic overdefined polynomial systems that have been used in comparisons before in the literature and are also part of cryptanalytic challenges.

We provide a simple method to compute the Betti numbers if the Stanley-Reisner ideal of a simplicial tree and its Alexander dual.

Let $(Q,\mathfrak{m},{\sf k})$ be a local ring that admits an exact pair of zero divisors $(f,g)$, $M$ a $Q$-module with $fM = 0$ and $U$ a free resolution of $M$ over $Q$. We construct a degree $-2$ chain map, which we call an Einsenbud operator, on the complex $U \otimes_Q Q/(f,g)$ and use the mapping cone of the operator to study two exact sequences that relate homology over $Q$ to homology over $Q/(f)$. Several applications are given.

We determine Gr\"{o}bner bases for the presentation ideals of multi-Rees algebras and their special fiber rings. Specifically, we focus on modules that are direct sums of ideals generated by either maximal minors of a two-sided ladder matrix or unit interval determinantal ideals. Our analysis reveals that the multi-blowup algebras are Koszul Cohen--Macaulay normal domains, possess rational singularities in characteristic zero, and are F-rational in positive characteristic.

Let $M$ be a module over a Noetherian local ring $A$. We study $M$-independent sequences of elements of $\mathfrak{m}_A$ in the sense of Lech and Hanes. The main tool is a new characterization of the $M$-independence of a sequence in terms of the associated Koszul complex. As applications, we give a result in linkage theory, a freeness criterion for $M$ in terms of the existence of a strongly $M$-independent sequence of length $edim(A)$, and another freeness criterion inspired from the patching method of Calegari and Geraghty for balanced modules in their 2018 paper.