Results 91 to 100 of about 830,410 (239)
On the maximum likelihood degree of Gaussian graphical models
Abstract In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML‐degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML‐degree of the nth$n{\rm th}$ cycle is larger than 1 for any n⩾4$n\geqslant 4$, therefore completing the characterization ...
Carlos Améndola +3 more
wiley +1 more source
The k-Zero-Divisor Hypergraph of a Commutative Ring
The concept of the zero-divisor graph of a commutative ring has been studied by many authors, and the k-zero-divisor hypergraph of a commutative ring is a nice abstraction of this concept.
Ch. Eslahchi, A. M. Rahimi
doaj +1 more source
Properties of ideal-based zero-divisor graphs of commutative rings [PDF]
Let R be a commutative ring with nonzero identity and I an ideal of R. The focus of this research is on a generalization of the zero-divisor graph called the ideal-based zero-divisor graph for commutative rings with nonzero identity.
Jesse Gerald Smith, Jr. +1 more
core
Bounded exponential sums with multiplicative coefficients
Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
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
Abelian number fields with frobenian conditions
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
THE DOMINATION OF ZERO DIVISOR GRAPH ON THE LINE GRAPH [PDF]
The directed Zero divisor graph is a graph constructed out of a non-Commutative ring R and its non-zero divisors. In this paper we find various domination parameter for the zero-divisor graph.
R, PREMKUMAR
core
An effective Bombieri–Vinogradov error term for sifting problems
Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley +1 more source
The n-zero-divisor graph of a commutative semigroup
Let S be a (multiplicative) commutative semigroup with 0, Z(S) the set of zero-divisors of S, and n a positive integer. The zero-divisor graph of S is the (simple) graph Γ(S) with vertices Z(S) ∗ = Z(S) \ {0}, and distinct vertices x and y are adjacent ...
Badawi, Ayman, Anderson, David F.
core +1 more source
Improving the Empirical Formulae for CIE Daylight Illuminants
CIE daylight illuminants (D‐Series) are widely used as reference illuminants for computing the color rendering index (Ra) and color fidelity index (Rf), yet the correlated color temperature (CCT) of the generated daylight SPD deviates from the specified value, with the error growing as CCT increases.
Cheng Gao +4 more
wiley +1 more source

