Results 71 to 80 of about 1,637,051 (209)
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings
In recent years, the intersection of algebraic structures and graph-theoretic concepts has developed significant interest, particularly through the study of zero-divisor graphs derived from commutative rings.
Omaima Alshanquiti +2 more
doaj +1 more source
On endomorphism-regularity of zero-divisor graphs
Let \(G\) be a graph and \(\text{End}(G)\) the semigroup consisting of all the endomorphisms of \(G\). An element \(a\) of a semigroup \(S\) is called regular if \(a=aba\) for some \(b\in S\), and \(S\) is called regular if every element in \(S\) is regular. A graph \(G\) is called end-regular if \(\text{End}(G)\) is regular.
Dancheng Lu, Tongsuo Wu
openaire +1 more source
Characteristic‐free normalized Nash blowup of toric varieties
Abstract We introduce conditions on cones of normal toric varieties under which the polyhedron defining the normalized Nash blowup does not depend on the characteristic of the base field. As a consequence, we deduce several results on the resolution of singularities properties of normalized Nash blowups.
Federico Castillo +3 more
wiley +1 more source
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
Abstract The tropical n$n$‐gonal construction was introduced in recent work by the first author and D. Zakharov and structural results for n=2,3$n = 2,3$ were established. In this paper, we explore the construction for n=4$n = 4$ and prove a tropical analogue of Donagi's theorem which states that the tetragonal construction is a triality which ...
Felix Röhrle, Thomas Saillez
wiley +1 more source
Cut-structures in zero-divisor graphs of commutative rings
Zero-divisor graphs, and more recently, compressed zero-divisor graphs are well represented in the commutative ring literature. In this work, we consider various cut structures, sets of edges or vertices whose removal disconnects the graph, in both ...
Axtell, Mike +2 more
core +1 more source
Multiplicative irreducibility of shifted multiplicative subgroups
Abstract In a recent breakthrough, Kalmynin resolved conjectures of Lev–Sonn and Sárközy on additive decompositions of multiplicative subgroups of prime fields. In this paper, inspired by a related conjecture of Sárközy, we prove multiplicative analogues of Kalmynin's results. We show that for every proper multiplicative subgroup G$G$, the shifted set (
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
wiley +1 more source
Converting an Integer to a Decimal String in Under Two Nanoseconds
ABSTRACT Objective Converting binary integers to variable‐length decimal strings is a fundamental operation in computing. Conventional fast approaches rely on recursive division and small lookup tables. The goal of this work is to develop a significantly faster method for this task.
Jaël Champagne Gareau, Daniel Lemire
wiley +1 more source
A generalisation of Cameron's base size conjecture
Abstract Let G⩽Sym(Ω)$G\leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser H$H$. A base for G$G$ is a subset of Ω$\Omega$ whose pointwise stabiliser is trivial, and the minimal cardinality of a base is called the base size of G$G$, denoted by b(G,Ω)$b(G, \Omega)$. Equivalently, b(G,Ω)$b(G, \Omega)$ is the minimal
Marina Anagnostopoulou‐Merkouri
wiley +1 more source
The Wiener index and the Wiener Complexity of the zero-divisor graph of a ring [PDF]
We calculate the Wiener index of the zero-divisor graph of a finite semisimple ring. We also calculate the Wiener complexity of the zero-divisor graph of a finite simple ring and find an upper bound for the Wiener complexity in the semisimple ...
Dolžan, David
core

