Previous Page 16

Displaying 301 – 319 of 319

Showing per page

Covering energy of posets and its bounds

Vandana P. Bhamre, Madhukar M. Pawar (2023)

Mathematica Bohemica

The concept of covering energy of a poset is known and its McClelland type bounds are available in the literature. In this paper, we establish formulas for the covering energy of a crown with 2 n elements and a fence with n elements. A lower bound for the largest eigenvalue of a poset is established. Using this lower bound, we improve the McClelland type bounds for the covering energy for some special classes of posets.

Coxeter-like complexes.

Babson, Eric, Reiner, Victor (2004)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Cycle-free cuts of mutual rank probability relations

Karel De Loof, Bernard De Baets, Hans De Meyer (2014)

Kybernetika

It is well known that the linear extension majority (LEM) relation of a poset of size n 9 can contain cycles. In this paper we are interested in obtaining minimum cutting levels α m such that the crisp relation obtained from the mutual rank probability relation by setting to 0 its elements smaller than or equal to α m , and to 1 its other elements, is free from cycles of length m . In a first part, theoretical upper bounds for α m are derived using known transitivity properties of the mutual rank probability...

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli (2022)

Archivum Mathematicum

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the...

Cyclically valued rings and formal power series

Gérard Leloup (2007)

Annales mathématiques Blaise Pascal

Rings of formal power series k [ [ C ] ] with exponents in a cyclically ordered group C were defined in [2]. Now, there exists a “valuation” on k [ [ C ] ] : for every σ in k [ [ C ] ] and c in C , we let v ( c , σ ) be the first element of the support of σ which is greater than or equal to c . Structures with such a valuation can be called cyclically valued rings. Others examples of cyclically valued rings are obtained by “twisting” the multiplication in k [ [ C ] ] . We prove that a cyclically valued ring is a subring of a power series ring k [ [ C , θ ] ] with...

Currently displaying 301 – 319 of 319

Previous Page 16