Related papers: Essential CR set near zero
The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…
Let $\alpha>0$ and $0<\gamma<1$. Define $g_{\alpha,\gamma}:\mathbb{N}\rightarrow\mathbb{N}$ by $g_{\alpha,\gamma}\left(n\right)=\lfloor\alpha n+\gamma\rfloor$. The set $\left\{ g_{\alpha,\gamma}\left(n\right):n\in\mathbb{N}\right\} $ is…
The cluster-tilted algebras have been introduced by Buan, Marsh and Reiten, they are the endomorphism rings of cluster-tilting objects $T$ in cluster categories; we call such an algebra cluster-concealed in case $T$ is obtained from a…
In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…
Let G be the Sylow 2-subgroup of the unitary group $SU_3(4)$. We find two essential classes in the mod-2 cohomology ring of G whose product is nonzero. In fact, the product is the ``last survivor'' of Benson-Carlson duality. Recent work of…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
We introduce \emph{residually dominated groups} in pure henselian valued fields of equicharacteristic zero, as an analogue of stably dominated groups introduced by Hrushovski and Rideau-Kikuchi. We show that when $G$ is a residually…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…
Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…
The Theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a…
A transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…
We consider the ideal structure of reduced crossed products over discrete groups. First, we completely characterize primality for reduced crossed products. Second, we characterize the ideal intersection property for reduced crossed products…
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…
Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…
The theory of designs is an important branch of combinatorial mathematics. It is well-known in the theory of designs that a finite subset of a sphere is a tight spherical 1-design if and only if it is a pair of antipodal points. On the…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
We give a complete description of the absolute of commutative finitely generated groups and semigroups. The absolute (previously called the exit boundary) is a further elaboration of the notion of the boundary of a random walk on a group…
A ring $R$ is said to be centrally essential if for every its non-zero element $a$, there exist non-zero central elements $x$ and $y$ with $ax = y$. A ring $R$ is said to be completely centrally essential if all its factor rings are…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…