Results 31 to 40 of about 59,986 (267)
Coloring Complexes and Combinatorial Hopf Monoids
, 2021 We generalize the notion of coloring complex of a graph to linearized combinatorial Hopf monoids. These are a generalization of the notion of coloring complex of a graph. We determine when a combinatorial Hopf monoid has such a construction, and discover
White, Jacob
core
Notices of the American Mathematical Society, 2019 4 pages of text, 3 pages of ...
openaire +2 more sources
A Bennequin-Type Inequality and Combinatorial Bounds [PDF]
Michigan Mathematical Journal, 2019 In this paper we provide a new Bennequin-type inequality for the Rasmussen- Beliakova-Wehrli invariant, featuring the numerical transverse braid invariants (the c-invariants) introduced by the author. From the Bennequin type-inequality, and a combinatorial bound on the value of the c-invariants, we deduce a new computable bound on the Rasmussen ...
openaire +3 more sources
Optimal capacitated ring trees
EURO Journal on Computational Optimization, 2016 We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees.
Alessandro Hill, Stefan Voß
doaj +1 more source
PLoS ONE, 2020 We present a two-stage methodology called Positions and Covering (P&C) to solve the two-dimensional bin packing problem (2D-BPP). The objective of this classical combinatorial NP-hard problem is to pack a set of items (small rectangles) in the minimum ...
Nestor M Cid-Garcia, Yasmin A Rios-Solis
doaj +1 more source
Additive energies on discrete cubes
Discrete Analysis, 2023 One definition of additive combinatorics is that it is the study of subsets of (usually Abelian) groups. Two much studied parameters associated with a subset $A$ are the size of its sumset $A+A=\{a+b:a,b\in A\}$ (or the product set $A.A=\{a.b:a,b\in A\}$
Jaume de Dios Pont +3 more
doaj +1 more source
A combinatorial approach to small ball inequalities for sums and differences
, 2018 Small ball inequalities have been extensively studied in the setting of Gaussian processes and associated Banach or Hilbert spaces. In this paper, we focus on studying small ball probabilities for sums or differences of independent, identically ...
Li, Jiange, Madiman, Mokshay
core +1 more source
Combinatorial set theory and cardinal function inequalities [PDF]
Proceedings of the American Mathematical Society, 1991 Three theorems of combinatorial set theory are proven. From the first we obtain the de Groot inequality | X | ≤ 2 h L ( X ) \left | X \right | \leq {2^{hL(X ...
openaire +2 more sources
Relating Sombor and Euler indices
Vojnotehnički GlasnikIntroduction/purpose: The Euler-Sombor index (EU) is a new vertexdegree-based graph invariant, obtained by geometric consideration. It is closely related to the Sombor index (SO). The actual form of this relation is established.
Ivan Gutman
doaj +1 more source
A combinatorial approach to correlation inequalities
Discrete Mathematics, 2002 This paper presents new proofs of two theorems originally proved in the 1980s. Consider an arbitrary finite partially ordered set \(P\). For two elements \(x\) and \(y\) of \(P\), the probability that \(x>y\), \(\text{prob}[x>y]\), is the fraction of linear extensions of \(P\) in which \(x>y\).
Brightwell, Graham R. +1 more
openaire +2 more sources