Results 71 to 80 of about 1,233,365 (217)
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
On endomorphism-regularity of zero-divisor graphs
Discrete Mathematics, 2008 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
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
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
Zero Divisor Graphs and Poset Decomposition [PDF]
, 2011 A graph is associated to any commutative ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ...
Putnam, Bette Catherine
core +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
On 7‐adic Galois representations for elliptic curves over Q$\mathbb {Q}$
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract In recent years, significant progress has been made on Mazur's Program B, with many authors beginning a systematic classification of all possible images of p$p$‐adic Galois representations attached to elliptic curves over Q$\mathbb {Q}$. Currently, the classification is only complete for p∈{2,3,13,17}$p \in \lbrace 2,3,13,17\rbrace$.
Lorenzo Furio, Davide Lombardo
wiley +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 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
The asymptotic Mahler measure of Gaussian periods
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen +2 more
wiley +1 more source