Results 61 to 70 of about 17,702 (242)
Combinatorics of binomial decompositions of the simplest Hodge integrals
, 2003 We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of Bernoulli numbers ...
Shadrin, S. V.
core +1 more source
An extension of the cogrowth formula to arbitrary subsets of the tree
Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.Abstract What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a given subset, in terms of the exponential decay rate of the analogous probability of the non‐backtracking
Doron Puder
wiley +1 more source
A note on algebraic rank, matroids, and metrized complexes
, 2017 We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field.
Len, Yoav
core +1 more source
The weakly zero-divisor graph of a commutative ring [PDF]
, 2021 M. J. Nikmehr +2 more
openalex +1 more source
The modular automorphisms of quotient modular curves
Mathematika, Volume 72, Issue 1, January 2026.Abstract We obtain the modular automorphism group of any quotient modular curve of level N$N$, with 4,9∤N$4,9\nmid N$. In particular, we obtain some unexpected automorphisms of order 3 that appear for the quotient modular curves when the Atkin–Lehner involution w25$w_{25}$ belongs to the quotient modular group. We also prove that such automorphisms are
Francesc Bars, Tarun Dalal
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
On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn
Electronic Journal of Graph Theory and Applications, 2021 For a finite commutative ring ℤn with identity 1 ≠ 0, the zero divisor graph Γ(ℤn) is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices x and y are adjacent if and only if xy=0.
S. Pirzada +3 more
doaj +1 more source
Zero-divisor graphs of idealizations
Journal of Pure and Applied Algebra, 2006 The authors of the reviewed paper (with \textit{J. Coykendall}) examined in [Commun. Algebra 33, No. 6, 2043--2050 (2005; Zbl 1088.13006)] the preservation, or lack thereof, of the diameter and girth of the graph of a commutative ring under extensions to polynomial and power series rings.
Axtell, Michael, Stickles, Joe
openaire +2 more sources
Algebraic Connectivity Maximizing Regular Graphs: Special Case Analysis and Depth‐First Search
Concurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.ABSTRACT The algebraic connectivity is an indicator of how well connected a graph is. It also characterizes the convergence speed of some dynamic processes over networks. In this paper, taking into account that homogeneous networks are modeled as regular graphs, we tackle the following problem: given a pair (n,k)$$ \left(n,k\right) $$ of positive ...
Masashi Kurahashi +3 more
wiley +1 more source
Analysis of Eccentricity-Based Topological Invariants with Zero-Divisor Graphs
Journal of Function Spaces, 2022 Let R=Z♭1♭2♭3×Zq2 be a commutative ring, where ♭1,♭2,♭3 are distinct primes, and q is any prime integer. A zero divisor graph JR of ring R is a graph with vertex set consist of zero divisors elements of R and any two vertices a,b are adjacent if and only
Zhi-hao Hui +3 more
doaj +1 more source