English
Related papers

Related papers: Sampling Algebra Structures on Minimal Free Resolu…

200 papers

A complete local ring of embedding codepth 3 has a minimal free resolution of length 3 over a regular local ring. Such resolutions carry a differential graded algebra structure, based on which one can classify local rings of embedding…

Commutative Algebra · Mathematics 2012-11-15 Lars Winther Christensen , Oana Veliche

Reduced ideals have been defined in the context of integer rings in quadratic number fields, and they are closely tied to the continued fraction algorithm. The notion of this type of ideal extends naturally to number fields of higher…

Number Theory · Mathematics 2019-06-04 George Jacobs

In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…

Computational Complexity · Computer Science 2007-05-23 Nikolai Vereshchagin , Paul Vitanyi

We develop infinite-dimensional Ramsey theory for Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages. We show that our approach is optimal and in particular, recovers the exact big Ramsey degrees…

Logic · Mathematics 2023-12-27 Natasha Dobrinen , Andy Zucker

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

Commutative Algebra · Mathematics 2025-02-12 Takayuki Hibi , Somayeh Moradi

We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…

Category Theory · Mathematics 2015-11-06 Mitchell Buckley

It has become obvious that certain singular phenomena cannot be explained by a mere investigation of the configuration space, defined as the solution set of the loop closure equations. For example, it was observed that a particular 6R…

Robotics · Computer Science 2019-10-23 Zijia Li , Andreas Müller

The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…

Computational Complexity · Computer Science 2007-05-23 Paul Vitanyi

Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…

Algebraic Geometry · Mathematics 2013-02-14 Tsemo Aristide

Using divisibility relations between the generators of a square-free monomial ideal $I$, we describe divisibility relations between the generators of the second power $I^2$. We then employ discrete Morse theory to produce a cellular free…

Commutative Algebra · Mathematics 2026-05-22 Susan M. Cooper , Sabine El Khoury , Sara Faridi , Susan Morey , Liana M. Sega , Sandra Spiroff

We study (two-sided) ideals $I$ in the enveloping algebra $\U(\frak g_\infty)$ of an infinite-dimensional Lie algebra $\frak g_\infty$ obtained as the union (equivalently, direct limit) of an arbitrary chain of embeddings of simple…

Algebraic Geometry · Mathematics 2012-10-02 Ivan Penkov , Alexey Petukhov

We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the…

Commutative Algebra · Mathematics 2024-06-11 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik…

Commutative Algebra · Mathematics 2013-12-03 Jin Guo , Tongsuo Wu , Houyi Yu

Neural codes form an algebraic framework to study the nervous system, and understanding neural codes is a key goal of mathematical neuroscience. Neural rings and ideals are the tools connecting neuroscience and commutative algebra. In this…

Commutative Algebra · Mathematics 2025-11-25 Trung Chau

We will explore some properties of minimal graded free resolutions of $R/I$, where $R$ is a trivariate polynomial ring over a field and $I$ is a monomial ideal. Our focus will be to consider a specific form of the resolutions when $I$ is…

Commutative Algebra · Mathematics 2013-03-05 Jared Painter

A cover by left ideals of an associative (not necessarily commutative or unital) ring $R$ is a collection of proper left ideals whose set-theoretic union equals $R$. If such a cover exists, then $\eta_\ell(R)$ is the cardinality of a…

Rings and Algebras · Mathematics 2026-02-27 Malcolm Hoong Wai Chen , Eric Swartz , Nicholas J. Werner

Inner ideals of simple locally finite dimensional Lie algebras over an algebraically closed field of characteristic 0 are described. In particular, it is shown that a simple locally finite dimensional Lie algebra has a non-zero proper inner…

Representation Theory · Mathematics 2013-01-29 Alexander Baranov , Jamie Rowley

Abstract algebra provides a large hierarchy of properties that a collection of objects can satisfy, such as forming an abelian group or a semiring. These classifications can arranged into a broad and typically acyclic directed graph. This…

Logic in Computer Science · Computer Science 2023-07-24 Eric Wieser

In this article, we study the jumping numbers of an ideal in the local ring at rational singularity on a complex algebraic surface. By understanding the contributions of reduced divisors on a fixed resolution, we are able to present an…

Algebraic Geometry · Mathematics 2008-02-17 Kevin Tucker

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…

Logic in Computer Science · Computer Science 2021-01-27 Vladimir Zamdzhiev