English
Related papers

Related papers: Primality of closed path polyominoes

200 papers

Completely prime right ideals are introduced as a one-sided generalization of the concept of a prime ideal in a commutative ring. Some of their basic properties are investigated, pointing out both similarities and differences between these…

Rings and Algebras · Mathematics 2011-02-23 Manuel L. Reyes

We prove Koszulity of certain linear path categories obtained from connected graphs with some infinite directed walk. These categories can be viewed as locally quadratic dual to preprojective algebras.

Representation Theory · Mathematics 2015-06-09 Brendan Dubsky

Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…

Rings and Algebras · Mathematics 2024-12-30 Joscha Diehl , Rosa Preiß , Jeremy Reizenstein

In this paper, we prove prime avoidance for ringoids. We also generalize McCoy's and Davis' prime avoidance theorems in the context of semiring theory. Next, we proceed to define and characterize compactly packed semirings and show that a…

Commutative Algebra · Mathematics 2025-07-08 Peyman Nasehpour

This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded…

Combinatorics · Mathematics 2015-07-08 Daniela Battaglino , Mathilde Bouvel , Andrea Frosini , Simone Rinaldi

For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…

Commutative Algebra · Mathematics 2016-08-12 Josephine Yu

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

In this paper we investigate Cohen-Macaulayness, Gorensteinness and the Hilbert-Poincar\'{e} series for some classes of non-prime collections of cells. In particular, we show that all closed path polyominoes are Cohen-Macaulay and we…

Commutative Algebra · Mathematics 2025-05-19 Carmelo Cisto , Rizwan Jahangir , Francesco Navarra

Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…

Combinatorics · Mathematics 2011-12-20 Zhicong Lin , Jiang Zeng

The Dixmier-Moeglin Equivalence (for short, the DM-equivalence) is the equivalence of three distinguishing properties of prime ideals in a non-commutative algebra A. These properties are of (i) being primitive, (ii) being rational, and…

Rings and Algebras · Mathematics 2021-12-21 Kulumani M. Rangaswamy

In this paper we introduce prime fuzzy ideals over a noncommutative ring. This notion of primeness is equivalent to level cuts being crisp prime ideals. It also generalizes the one provided by Kumbhojkar and Bapat in [Not-so-fuzzy fuzzy…

Rings and Algebras · Mathematics 2016-10-26 Gabriel Navarro , Oscar Cortadellas , F. J. Lobillo

We study prime tensor ideals in tensor abelian categories of quiver representations. Specifically, we classify the prime tensor ideals in the category of representations of zigzag quivers (with bounded path length) whose vertex set is the…

Representation Theory · Mathematics 2023-11-13 Shunsuke Tada

We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…

Soft Condensed Matter · Physics 2020-01-29 Keith Alexander , Alexander J Taylor , Mark R Dennis

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

Rings and Algebras · Mathematics 2012-10-30 Maurizio Imbesi , Monica La Barbiera

We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…

Commutative Algebra · Mathematics 2019-08-15 Federico Galetto , Anthony V. Geramita , David L. Wehlau

A famous result due to I. M. Isaacs states that if a commutative ring $R$ has the property that every prime ideal is principal, then every ideal of $R$ is principal. This motivates ring theorists to study commutative rings for which every…

Commutative Algebra · Mathematics 2022-08-18 R. Nikandish , M. J. Nikmehr , A. Yassine

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path…

Commutative Algebra · Mathematics 2026-03-17 Om Prakash Bhardwaj , Trung Chau , Omkar Javadekar

In this article, we consider the structure of graded rings, not necessarily commutative nor with unity, and study the graded weakly prime ideals. We investigate the graded rings in which all graded ideals are graded weakly prime. Several…

Rings and Algebras · Mathematics 2021-01-07 Azzh Saad Alshehry , Rashid Abu-Dawwas

We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of…

Computational Complexity · Computer Science 2010-05-20 Guillaume Bonfante

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

Computational Complexity · Computer Science 2025-03-27 Abhibhav Garg , Rafael Oliveira , Nitin Saxena