Related papers: Essential CR set near zero

In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…

We give a generalization to convex co-compact semigroups of a beautiful theorem of Patterson-Sullivan, telling that the critical exponent (that is the exponential growth rate) equals the Hausdorff dimension of the limit set (that is the…

In Combinatorial Game Theory, the fundamental relation of game equivalence, denoted by $=$, is introduced early on and overrides the notion of set equality. We explore what happens if set equality is given its due before game equivalence is…

The notion of "pseudocompactness" was introduced by Hewitt. The concept of relatively countably compact subspaces were explored by Marjanovic to show that a $\Psi$-space is pseudocompact. A topological space is said to be DRC (DRS) iff it…

Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…

The power graph of a group $G$ is a simple and undirected graph with vertex set $G$ and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and…

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…

A new characterization is given to describe implication bases of a closure system in terms of the system's quasi-closed sets. Using this characterization, it is possible to show that groups of implications corresponding to distinct…

A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…

The notion of almost centralizer and almost commutator are introduced and basic properties are established. They are used to study $\widetilde{\mathfrak M}\_c$-groups, i. e.groups for which every descending chain of centralizers each having…

The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…

The concept of $S$-characters of finite groups was introduced by Zhmud' as a generalisation of transitive permutation characters. Any non-trivial $S$-character takes a zero value on some group element. By a deep result depending on the…

Let $X$ be a proper geodesic Gromov hyperbolic metric space and let $G$ be a cocompact group of isometries of $X$ admitting a uniform lattice. Let $d$ be the Hausdorff dimension of the Gromov boundary $\partial X$. We define the critical…

We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families,…

We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

In [On $IP^{\star}$sets and central sets, Combinatorica, 14 (1994) 269-277], N. Hindman and V.Bergelson proved additive $IP^{\star}$-sets contain finite sums and finite products of a single sequence. An analogous study was made by A. Sisto…

The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to faithful group actions on sets; taking the set to be the vertex…

Let $\mathcal{Z(R)}$ be the set of zero divisor elements of a commutative ring $R$ with identity and $\mathcal{M}$ be the space of minimal prime ideals of $R$ with Zariski topology. An ideal $I$ of $R$ is called strongly dense ideal or…

The concepts of localizable set, localization of a ring and a module at a localizable set are introduced and studied. Localizable sets are generalization of Ore sets and denominator sets, and the localization of a ring/module at a…