Brauer–Clifford Group of Lie–Rinehart Algebras

In this paper we define the notion of Brauer–Clifford group for [Formula: see text]-Azumaya algebras when [Formula: see text] is a commutative algebra and[Formula: see text] is a [Formula: see text]-Lie algebra over a commutative ring [Formula: see text]. This is the situation that arises in applications having connections to differential geometry. This Brauer–Clifford group turns out to be an example of a Brauer group of a symmetric monoidal category.

The strength for line bundles

We introduce the strength for sections of a line bundle on an algebraic variety. This generalizes the strength of homogeneous polynomials that has been recently introduced to resolve Stillman's conjecture, an important problem in commutative algebra. We establish the first properties of this notion and give some tool to obtain upper bounds on the strength in this framework. Moreover, we show some results on the usual strength such as the reducibility of the set of strength two homogeneous polynomials.

Embeddings in matrix wreath products of algebras

We use matrix wreath products to show that (1) every countable dimensional nonsingular algebra is embeddable in a finitely generated nonsingular algebra, (2) for every infinite dimensional finitely generated PI-algebra [Formula: see text] there exists an epimorphism [Formula: see text], where [Formula: see text] and the algebra [Formula: see text] is not representable by matrices over a commutative algebra. If the algebra [Formula: see text] is commutative, then [Formula: see text] satisfies the ACC on two-sided ideals as in the recent examples of Greenfeld and Rowen.

Linear PDE with constant coefficients

We discuss practical methods for computing the space of solutions to an arbitrary homogeneous linear system of partial differential equations with constant coefficients. These rest on the Fundamental Principle of Ehrenpreis–Palamodov from the 1960s. We develop this further using recent advances in computational commutative algebra.

From amplitudes to contact cosmological correlators

Our understanding of quantum correlators in cosmological spacetimes, including those that we can observe in cosmological surveys, has improved qualitatively in the past few years. Now we know many constraints that these objects must satisfy as consequences of general physical principles, such as symmetries, unitarity and locality. Using this new understanding, we derive the most general scalar four-point correlator, i.e., the trispectrum, to all orders in derivatives for manifestly local contact interactions. To obtain this result we use techniques from commutative algebra to write down all possible scalar four-particle amplitudes without assuming invariance under Lorentz boosts. We then input these amplitudes into a contact reconstruction formula that generates a contact cosmological correlator in de Sitter spacetime from a contact scalar or graviton amplitude. We also show how the same procedure can be used to derive higher-point contact cosmological correlators. Our results further extend the reach of the boostless cosmological bootstrap and build a new connection between flat and curved spacetime physics.

Characteristic-free test ideals

Tight closure test ideals have been central to the classification of singularities in rings of characteristic p > 0 p>0 , and via reduction to characteristic p > 0 p>0 , in equal characteristic 0 as well. Their properties and applications have been described by Schwede and Tucker [Progress in commutative algebra 2, Walter de Gruyter, Berlin, 2012]. In this paper, we extend the notion of a test ideal to arbitrary closure operations, particularly those coming from big Cohen-Macaulay modules and algebras, and prove that it shares key properties of tight closure test ideals. Our main results show how these test ideals can be used to give a characteristic-free classification of singularities, including a few specific results on the mixed characteristic case. We also compute examples of these test ideals.

About the complexity of two-stage stochastic IPs

We consider so called 2-stage stochastic integer programs (IPs) and their generalized form, so called multi-stage stochastic IPs. A 2-stage stochastic IP is an integer program of the form $$\max \{ c^T x \mid {\mathcal {A}} x = b, \,l \le x \le u,\, x \in {\mathbb {Z}}^{s + nt} \}$$ max { c T x ∣ A x = b , l ≤ x ≤ u , x ∈ Z s + n t } where the constraint matrix $${\mathcal {A}} \in {\mathbb {Z}}^{r n \times s +nt}$$ A ∈ Z r n × s + n t consists roughly of n repetitions of a matrix $$A \in {\mathbb {Z}}^{r \times s}$$ A ∈ Z r × s on the vertical line and n repetitions of a matrix $$B \in {\mathbb {Z}}^{r \times t}$$ B ∈ Z r × t on the diagonal. In this paper we improve upon an algorithmic result by Hemmecke and Schultz from 2003 [Hemmecke and Schultz, Math. Prog. 2003] to solve 2-stage stochastic IPs. The algorithm is based on the Graver augmentation framework where our main contribution is to give an explicit doubly exponential bound on the size of the augmenting steps. The previous bound for the size of the augmenting steps relied on non-constructive finiteness arguments from commutative algebra and therefore only an implicit bound was known that depends on parameters r, s, t and $$\Delta $$ Δ , where $$\Delta $$ Δ is the largest entry of the constraint matrix. Our new improved bound however is obtained by a novel theorem which argues about intersections of paths in a vector space. As a result of our new bound we obtain an algorithm to solve 2-stage stochastic IPs in time $$f(r,s,\Delta ) \cdot \mathrm {poly}(n,t)$$ f ( r , s , Δ ) · poly ( n , t ) , where f is a doubly exponential function. To complement our result, we also prove a doubly exponential lower bound for the size of the augmenting steps.