Results 231 to 240 of about 59,986 (267)

A certain combinatorial inequality

Siberian Mathematical Journal, 1989
See the review in Zbl 0658.05031.
openaire   +1 more source

Generalizations of Stanley’s Theorem: Combinatorial Proofs and Related Inequalities

Mediterranean Journal of Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cristina Ballantine, Mircea Merca
openaire   +1 more source

A combinatorial approach to information inequalities

1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
The authors present theorems that lead to a new combinatorial approach to prove information inequality. The non-negativity of Shannon's information measures can all be derived using this combinatorial approach, and each of these inequalities has a very simple intuitive combinatorial explanation.
null Ho-Leung Chan, R.W. Yeung
openaire   +1 more source

Combinatorial Inequalities for Geometric Lattices

1973
A geometric lattice is a semimodular point lattice L. The ith Whitney number of Lis the number of elements of rank i in L. The logarithmic concavity conjecture states that Wi(L)2/Wi-1(L)Wi+1(L) ≥ 1 for any finite geometric lattice L. In a finite nondirected graph without loops or double edges, a set of edges is closed if whenever it contains all but
openaire   +1 more source

Some inequalities with combinatorial applications

2012
Some inequalities of H. J. Ryser with combinatorial applications are generalized. Let f be a non-negative concave symmetric function on v-tuples of non-negative reals. If f has the property that when θa + (1- θ)b ∈ G[subscript f] = f[power -1] ({t:t > 0}), 0 < θ < 1, then f(θa + (1- θ)b) = θf(a) + (1-θ)f(b), then we say that f is strictly ...
openaire   +1 more source

Incidence matrices and inequalities for combinatorial designs

Journal of Combinatorial Designs, 2001
AbstractIn this paper we use incidence matrices of block designs and row–column designs to obtain combinatorial inequalities. We introduce the concept of nearly orthogonal Latin squares by modifying the usual definition of orthogonal Latin squares.
Raghavarao, D., Shrikhande, S. S., Shrikhande, M. S.   +2 more
openaire   +1 more source

Combinatorial Proof of a Partition Inequality of Bessenrodt-Ono

Annals of Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alanazi, Abdulaziz A., Gagola, Stephen M. III, Munagi, Augustine O.   +2 more
openaire   +1 more source

Combinatorial Identities and Inequalities for Trigonometric Sums

2020
The purpose of this paper is twofold. 1. We present two short and elementary new proofs for the identity $$\displaystyle {(*)} \quad \sum _{k=0}^n {n\choose k}{c\choose k+m} (z+1)^k = \sum _{k=0}^n {n\choose k}{n-k+c\choose n+m} z^k, $$ which was recently proved by Chen and Reidys by using combinatorial methods. 2. Inspired by
Horst Alzer, Omran Kouba, Man Kam Kwong
openaire   +1 more source

A Combinatorial Proof of the Ringel-Vossieck Inequality

Bulletin of the London Mathematical Society, 1993
Let \(H\) be a left hammock with hammock function \(h\) and translation \(\tau\). The Ringel-Vossieck inequality is \(h(\tau X) - h(X) \leq 1\) for all \(X\in H\). This is a purely combinatorial statement and we give a purely combinatorial proof of it. Let \(A\) be a finite dimensional algebra over an algebraically closed field \(k\).
openaire   +1 more source

Combinatorial Inequalities, Matrix Norms, and Generalized Numerical Radii. II

1980
Two recently established combinatorial inequalities are used in order to investigate the submultiplicativity of a new family of norms on the algebra of n × n complex matrices. The family is that of the C-numerical radii, which are generalizations of the classical numerical radius.
Moshe Goldberg, E. G. Straus
openaire   +1 more source