Solution d'une question d'analyse proposée au concours d'agrégation de 1880
Near Domains of Composite Characteristic.
Noncommutative operational calculus.
Adjoint regular rings.
Convolution algebras arising from Sturm-Liouville transforms and applications.
Medial rings and an associated radical
Extinction in a generalized Lotka-Volterra predator-prey model.
Minimal and maximal ideals in rings with involution.
A Note on the Total Detection Numbers of Cycles
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a0, a1, . . . , ak−1), where ai is the number of edges incident with v that are labeled i for 0 ≤ i ≤ k − 1. The labeling c is called a detectable labeling if distinct vertices in G have distinct color codes. The value val(c) of...
Page 1