Results 11 to 20 of about 62 (61)
A coboundary Temperley–Lieb category for sl2$\mathfrak {sl}_{2}$‐crystals
Abstract By considering a suitable renormalization of the Temperley–Lieb category, we study its specialization to the case q=0$q=0$. Unlike the q≠0$q\ne 0$ case, the obtained monoidal category, TL0(k)$\mathcal {TL}_0(\mathbb {k})$, is not rigid or braided. We provide a closed formula for the Jones–Wenzl projectors in TL0(k)$\mathcal {TL}_0(\mathbb {k})$
Moaaz Alqady, Mateusz Stroiński
wiley +1 more source
On the dimension of orthogonal projections of self‐similar measures
Abstract Let ν$\nu$ be a self‐similar measure on Rd$\mathbb {R}^d$, d⩾2$d\geqslant 2$, and let π$\pi$ be an orthogonal projection onto a k$k$‐dimensional subspace. We formulate a criterion on the action of the group generated by the orthogonal parts of the iterated function system on π$\pi$, and show that it ensures that the dimension of πν$\pi \nu$ is
Amir Algom, Pablo Shmerkin
wiley +1 more source
On the isomorphism problem for monoids of product‐one sequences
Abstract Let G1$G_1$ and G2$G_2$ be torsion groups. We prove that the monoids of product‐one sequences over G1$G_1$ and over G2$G_2$ are isomorphic if and only if the groups G1$G_1$ and G2$G_2$ are isomorphic. This was known before for abelian groups.
Alfred Geroldinger, Jun Seok Oh
wiley +1 more source
On minimal presentations of numerical monoids
Abstract We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing this problem, we apply tools from Hilbert functions and free resolutions of artinian standard graded ...
Alessio Moscariello, Alessio Sammartano
wiley +1 more source
Linking Bipartiteness and Inversion in Algebra via Graph‐Theoretic Methods and Simulink
Research for decades has concentrated on graphs of algebraic structures, which integrate algebra and combinatorics in an innovative way. The goal of this study is to characterize specific aspects of bipartite and inverse graphs that are associated with specific algebraic structures, such as weak inverse property quasigroups and their isotopes ...
Mohammad Mazyad Hazzazi +6 more
wiley +1 more source
Let N,Z, and Q be the sets of natural, integers, and rational numbers, respectively. Our objective, involving a predetermined positive integer a, is to study a characterization of Diophantine equations of the form a + y2 = z2. Building on this result, we aim to obtain a characterization for Pythagorean n‐tuples.
Roberto Amato, Anwar Saleh Alwardi
wiley +1 more source
On the diameter of semigroups of transformations and partitions
Abstract For a semigroup S$S$ whose universal right congruence is finitely generated (or, equivalently, a semigroup satisfying the homological finiteness property of being type right‐FP1$FP_1$), the right diameter of S$S$ is a parameter that expresses how ‘far apart’ elements of S$S$ can be from each other, in a certain sense.
James East +4 more
wiley +1 more source
Characterizing Topologically Dense Injective Acts and Their Monoid Connections
In this paper, we explore the concept of topologically dense injectivity of monoid acts. It is shown that topologically dense injective acts constitute a class strictly larger than the class of ordinary injective ones. We determine a number of acts satisfying topologically dense injectivity.
Masoomeh Hezarjaribi Dastaki +3 more
wiley +1 more source
Ordered Left Almost ⋇‐Semihypergroups Based on Fuzzy Sets
The concept of an involution or anti‐involution is a self‐inverse linear mapping that plays a prominent role in the theory of algebraic structures, particularly rings, hyperrings, ordered semigroups, and ordered semihypergroups. Nowadays, the study of involutions in ordered hyperstructures is a particular area of research in the field of hyperstructure
Nabilah Abughazalah +2 more
wiley +1 more source
Graphs Connected to Isotopes of Inverse Property Quasigroups: A Few Applications
Many real‐world applications can be modelled as graphs or networks, including social networks and biological networks. The theory of algebraic combinatorics provides tools to analyze the functioning of these networks, and it also contributes to the understanding of complex systems and their dynamics.
Muhammad Nadeem +3 more
wiley +1 more source

