Related papers: P-sets and minimal right ideals in N*

Let $(A,\mathfrak{m})$ be an abstract complete intersection and let $P$ be a prime ideal of $A$. In [1] Avramov proved that $A_P$ is an abstract complete intersection. In this paper we give an elementary proof of this result.

In this paper we give an answer to Furstenberg's problem on topological disjointness. Namely, we show that a transitive system $(X,T)$ is disjoint from all minimal systems if and only if $(X,T)$ is weakly mixing and there is some countable…

Let $f \colon X \to X$ be a continuous map on a compact metric space $X$ and let $\alpha_f$, $\omega_f$ and $ICT_f$ denote the set of $\alpha$-limit sets, $\omega$-limit sets and nonempty closed internally chain transitive sets…

An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…

Given an ideal $\mathcal{I}$ on $\omega$ and a sequence $x$ in a topological vector space, we let the $\mathcal{I}$-core of $x$ be the least closed convex set containing $\{x_n: n \notin I\}$ for all $I \in \mathcal{I}$. We show two…

We study the limiting behavior of minimizing $p$-harmonic maps from a bounded Lipschitz domain $\Omega \subset \mathbb{R}^{3}$ to a compact connected Riemannian manifold without boundary and with finite fundamental group as $p \nearrow 2$.…

Directed graphs can be partitioned in so-called passages. A passage P is a set of edges such that any two edges sharing the same initial vertex or sharing the same terminal vertex are both inside $P$ or are both outside of P. Passages were…

We give sufficient conditions for a group of homeomorphisms of a Peano continuum X without cut-points to be a convergence group. The condition is that there is a collection of convergence subgroups whose limit sets `cut up' X in the correct…

The classic N p chart gives a signal if the number of successes in a sequence of inde- pendent binary variables exceeds a control limit. Motivated by engineering applications in industrial image processing and, to some extent, financial…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$ and two distinct vertices are adjacent if one of them is a power of the other. Let $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r},$ where…

Given an undirected connected graph $G = (V(G), E(G))$ on $n$ vertices, the minimum Monitoring Edge-Geodetic Set (MEG-set) problem asks to find a subset $M \subseteq V(G)$ of minimum cardinality such that, for every edge $e \in E(G)$, there…

The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing…

Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are…

For every topological group G one can define the universal minimal compact G-space X=M_G characterized by the following properties: (1) X has no proper closed G-invariant subsets; (2) for every compact G-space Y there exists a G-map X-->Y.…

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Let $B$ be a reduced local (Noetherian) ring with maximal ideal $M$. Suppose that $B$ contains the rationals, $B/M$ is uncountable and $|B| = |B/M|$. Let the minimal prime ideals of $B$ be partitioned into $m \geq 1$ subcollections $C_1,…

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower…

An ILD-set in a connected graph is a subset $S$ of vertices such that it is both independent and locating-dominating. The independent locating-dominating number of a graph G is the minimum cardinality of an ILD-set set of $G$. A well-known…

A locally-optimal structure is a combinatorial structure such as a maximal independent set that cannot be improved by certain (greedy) local moves, even though it may not be globally optimal. It is trivial to construct an independent set in…