Results 61 to 70 of about 1,283,848 (178)
Zero-divisor graphs of lower dismantlable lattices II
, 2018 In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [PATIL, A.—WAPHARE, B. N.—JOSHI, V.—POURALI, H. Y.: Zero-divisor graphs of lower dismantlable lattices I, Math. Slovaca 67 (2017), 285–296].
Avinash Patil +2 more
core +1 more source
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.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
Irreducible divisor graphs in commutative rings with zero divisors
, 2008 In their article “Irreducible Divisor Graphs”, Coykendall and Maney (2007) introduced the idea of irreducible divisor graphs of elements of a domain. We generalize this concept to commutative rings with zero divisors.
Stickles, Joe, Axtell, Michael
core +1 more source
Multiplicative irreducibility of shifted multiplicative subgroups
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.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
On domination numbers of zero-divisor graphs of commutative rings
Electronic Journal of Graph Theory and ApplicationsZero-divisor graphs of a commutative ring R, denoted Γ(R), are well-represented in the literature. In this paper, we consider domination numbers of zero-divisor graphs. For reduced rings, Vatandoost and Ramezani characterized the possible graphs for Γ(R)
Sarah E. Anderson +3 more
doaj +1 more source
Converting an Integer to a Decimal String in Under Two Nanoseconds
Software: Practice and Experience, Volume 56, Issue 8, Page 963-977, August 2026.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
L-zero-divisor graphs of direct products of L-commutative rings [PDF]
, 2011 L-zero-divisor graphs of L-commutative rings have been introduced and studied in [5]. Here we consider L-zero-divisor graphs of a finite direct product of L-commutative rings.
Kohan, M., Atani, S.
core +1 more source
Zero-divisor graphs of reduced Rickart *-rings
Discussiones Mathematicae - General Algebra and Applications, 2017 For a ring A with an involution *, the zero-divisor graph of A, Γ*(A), is the graph whose vertices are the nonzero left zero-divisors in A such that distinct vertices x and y are adjacent if and only if xy* = 0.
Patil A.A., Waphare B.N.
doaj +1 more source
A generalisation of Cameron's base size conjecture
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.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
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
Journal of Chemistry, 2022 In computer science and mathematics, a partition of a set into two or more disjoint subsets with equal sums is a well-known NP-complete problem. This is a hard problem and referred to as the partition problem or number partitioning.
M. Haris Mateen +4 more
doaj +1 more source