Related papers: Primality of closed path polyominoes
Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
We develop purely algebraic methods for proving that a knot is prime. Our approach uses the Heegaard Floer polynomial in conjunction with classical knot-theoretic methods: cyclic, dihedral, and metacyclic covering spaces. The theory of…
In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…
We prove that a Stein manifold admits a closed holomorphic 1-form without zeros in every class of the first cohomology group. We also prove an approximation result for closed holomorphic 1-forms without zeros defined in a neighborhood of a…
We characterize the isomorphism types of principal ideals of the Turing degrees below 0' that are lattices as the lattices with a Sigma-0-3 presentation, by showing that each Sigma-0-3 presentable bounded upper semilattice is isomorphic to…
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…
We show that closures of homogeneous braids are visually prime, addressing a question of Cromwell. The key technical tool for the proof is the following criterion concerning primeness of open books, which we consider to be of independent…
There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…
We give an elementary proof that for a ring homomorphism A -> B, satisfying the property that every ideal in A is contracted from B, the following property holds: for every chain of prime ideals p_0 \subset ... \subset p_r in A there exists…
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…
The primary purpose of this paper is give a classification scheme for the nonzero primes of a Pr\"ufer domain based on five properties. A prime $P$ of a Pr\"ufer domain $R$ could be sharp or not sharp, antesharp or not, divisorial or not,…
Internal preneighbourhood spaces inside any finitely complete category with finite coproducts and proper factorisation structure were first introduced in my earlier paper. This paper proposes a closure operation on internal preneighbourhood…
We prove that the theory of open projective planes is complete and strictly stable, and infer from this that Marshall Hall's free projective planes $(\pi^n : 4 \leq n \leq \omega)$ are all elementary equivalent and that their common theory…
We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
There is an extensive recent literature on the graded, non-graded, prime, primitive, maximal ideals of Leavitt path algebras. In this introductory level survey, we will be giving an overview of different types of ideals and the…
Given a polynomial ring $C$ over a field and proper ideals $I$ and $J$ whose generating sets involve disjoint variables, we determine how to embed the associated primes of each power of $I+J$ into a collection of primes described in terms…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We show that for ideals primary to a maximal ideal in a normal domain of finite type over the complex numbers, its tight closure is contained inside the continuous closure.