Results 31 to 40 of about 995,571 (241)

Exponential multivalued forbidden configurations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.
Travis Dillon, Attila Sali
doaj   +1 more source

Ramsey numbers of cycles versus general graphs

open access: yesForum of Mathematics, Sigma, 2023
The Ramsey number $R(F,H)$ is the minimum number N such that any N-vertex graph either contains a copy of F or its complement contains H. Burr in 1981 proved a pleasingly general result that, for any graph H, provided n is sufficiently large, a ...
John Haslegrave   +3 more
doaj   +1 more source

Parameter and q asymptotics of Lq‐norms of hypergeometric orthogonal polynomials

open access: yesInternational Journal of Quantum Chemistry, Volume 123, Issue 2, January 15, 2023., 2023
The weighted Lq‐norms of orthogonal polynomials are determined when q and the polynomial's parameter tend to infinity. They are given in this work by the leading term of the q and parameter asymptotics of the corresponding quantities of the associated probability density. These results are not only interesting per se, but also because they control many
Nahual Sobrino, Jesus S. Dehesa
wiley   +1 more source

Short proofs of some extremal results III [PDF]

open access: yes, 2020
We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together ...
Alon N.   +11 more
core   +4 more sources

Chromatic Turán problems and a new upper bound for the Turán density of $\mathcal{K}_4^-$ [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integer $k≥2$ determine the maximum number of edges in an $\mathcal{F}$-free, $k$-colourable $r$-graph on $n$ vertices.
John Talbot
doaj   +1 more source

On the quaternion projective space

open access: yesJournal of Taibah University for Science, 2020
Apart from being a vital and exciting field in mathematics with interesting results, projective spaces have various applications in design theory, coding theory, physics, combinatorics, number theory and extremal combinatorial problems. In this paper, we
Y. Omar   +4 more
doaj   +1 more source

Short proofs of some extremal results [PDF]

open access: yes, 2013
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck   +11 more
core   +5 more sources

The topological symmetric orbifold

open access: yesJournal of High Energy Physics, 2020
We analyze topological orbifold conformal field theories on the symmetric product of a complex surface M. By exploiting the mathematics literature we show that a canonical quotient of the operator ring has structure constants given by Hurwitz numbers ...
Songyuan Li, Jan Troost
doaj   +1 more source

Home - About - Disclaimer - Privacy