Related papers: Finite generation and geography of models
This paper is concerned with determining the number of generators in each degree for minimal sets of homogeneous generators for saturated ideals defining fat point subschemes $Z=m_1p_1+ ... +m_rp_r$ for general sets of points $p_i$ of…
Suppose that $f\colon X\to\mathrm{Spec}\, R$ is a minimal model of a complete local Gorenstein 3-fold, where the fibres of $f$ are at most one dimensional, so by [VdB1d] there is a noncommutative ring $\Lambda$ derived equivalent to $X$.…
An underlying structure in several sampling-based methods for continuous multi-robot motion planning (MRMP) is the tensor roadmap (TR), which emerges from combining multiple PRM graphs constructed for the individual robots via a tensor…
Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.
We discuss the minimal model program for b-log varieties, which is a pair of a variety and a b-divisor, as a natural generalization of the minimal model program for ordinary log varieties. We show that the main theorems of the log MMP work…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
Many classical constructions, such as Plotkin's and Turyn's, were generalized by matrix product (MP) codes. Quasi-twisted (QT) codes, on the other hand, form an algebraically rich structure class that contains many codes with best-known…
The main results of this paper are already known (V.V. Shokurov, the non-vanishing theorem, 1985). Moreover, the non-$\mathbb{Q}$-factorial MMP was more recently considered by O~Fujino, in the case of toric varieties (Equivariant…
Large-scale Markov decision processes (MDPs) require planning algorithms with runtime independent of the number of states of the MDP. We consider the planning problem in MDPs using linear value function approximation with only weak…
Probabilistic graphical models (PGMs) are widely used to discover latent structure in data, but their success hinges on selecting an appropriate model design. In practice, model specification is difficult and often requires iterative…
A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…
Score-based generative models (SGMs) need to approximate the scores $\nabla \log p_t$ of the intermediate distributions as well as the final distribution $p_T$ of the forward process. The theoretical underpinnings of the effects of these…
Diffusion models have had a profound impact on many application areas, including those where data are intrinsically infinite-dimensional, such as images or time series. The standard approach is first to discretize and then to apply…
Suppose that $X$ is an integral scheme (quasi-)projective over a complete local ring of mixed characteristic. Using ideas of Takamatsu-Yoshikawa and Bhatt-Ma-et. al, we define a notion of a $+$-test ideal on $X$, including for divisors and…
Given a three-dimensional projective log canonical pair over a perfect field of characteristic larger than five, there exists a minimal model program that terminates after finitely many steps.
Score-based Generative Models (SGMs) is one leading method in generative modeling, renowned for their ability to generate high-quality samples from complex, high-dimensional data distributions. The method enjoys empirical success and is…
We study certain modules over the algebra of a Cartier divisor on a scheme. Using these modules, we present an inductive method for studying finite generation properties of algebras and modules. In the context of the minimal model program,…
Traditional deep generative models of images and other spatial modalities can only generate fixed sized outputs. The generated images have exactly the same resolution as the training images, which is dictated by the number of layers in the…
We describe the Minimal Model Program in the family of $\mathbb{Q}$-Gorenstein projective horospherical varieties, by studying a family of polytopes defined from the moment polytope of a Cartier divisor of the variety we begin with. In…
For a commutative ring R we investigate the property that the sets of minimal primes of finitely generated ideals of R is always finite. We prove this property passes to polynomial ring extensions (in an arbitrary number of variables) over…