Related papers: Above and below
In this paper we prove several results on Ramsey numbers $R(H,F)$ for a fixed graph $H$ and a large graph $F$, in particular for $F = K_n$. These results extend earlier work of Erd\H{o}s, Faudree, Rousseau and Schelp and of Balister, Schelp…
We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,n}$ with $2n/3 + o(n)$ colors such that each $4$-cycle…
For any positive integers $k$ and $n$, let $B_n^{(k)}$ be the book graph consisting of $n$ copies of the complete graph $K_{k+1}$ sharing a common $K_k$. Let $C_m$ be a cycle of length $m$. Prior work by Allen, \L uczak, Polcyn, and Zhang…
For three decades binary decision diagrams, a data structure efficiently representing Boolean functions, have been widely used in many distinct contexts like model verification, machine learning, cryptography and also resolution of…
Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order first appears and are extremely difficult to calculate due to…
The so-called block-term decomposition (BTD) tensor model, especially in its rank-$(L_r,L_r,1)$ version, has been recently receiving increasing attention due to its enhanced ability of representing systems and signals that are composed of…
Euclidean functions with values in an arbitrary well-ordered set were first considered in a 1949 work of Motzkin and studied in more detail in work of Fletcher, Samuel and Nagata in the 1970's and 1980's. Here these results are revisited,…
We establish the exact-order estimates for the approximation of functions from the Nikol'skii-Besov classes $S^{\boldsymbol{r}}_{1,\theta} B(\mathbb{R}^d)$, $d\geqslant 1$, by entire function exponential type with some restrictions for…
Consider zero-dimensional Donaldson-Thomas invariants of a toric threefold or toric Calabi-Yau fourfold. In the second case, invariants can be defined using a tautological insertion. In both cases, the generating series can be expressed in…
Erd\H{o}s and Rado [P. Erd\H{o}s, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249-255] introduced the Canonical Ramsey numbers $\text{er}(t)$ as the minimum number $n$ such that every…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
The approximation properties of the Aldaz-Kounchev-Render (AKR) operators are discussed and classes of functions for which these operators approximate better than the classical Bernstein operators are described. The new results are then…
For two graphs $G,H$ and a positive integer $k$, the \emph{Gallai-Ramsey number} $\operatorname{gr}_k(G,H)$ is defined as the minimum number of vertices $n$ such that any $k$-edge-coloring of $K_n$ contains either a rainbow (all different…
The $k$-dimensional functional order property ($\text{FOP}_k$) is a combinatorial property of a $(k+1)$-partitioned formula. This notion arose in work of Terry and Wolf, which identified $\text{NFOP}_2$ as a ternary analogue of stability in…
We obtain order estimates for the best uniform orthogonal trigonometric approximations of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}, \ 1\leq p<\infty$, in case at consequences…
A new Hopf operad Ram is introduced, which contains both the well-known Poisson operad and the Bessel operad introduced previously by the author. Besides, a structure of cooperad R is introduced on a collection of algebras given by…
Let $p$ be a prime, let $r$ and $q$ be powers of $p$, and let $a$ and $b$ be relatively prime integers not divisible by $p$. Let $C/\mathbb F_{r}(t)$ be the superelliptic curve with affine equation $y^b+x^a=t^q-t$. Let $J$ be the Jacobian…
A weighted (directed) graph is a (directed) graph with integer weights assigned to its vertices and edges. The weight of a subgraph is the sum of weights of vertices and edges in the subgraph. The problem of determining the largest order…
We present a detailed computation of the cyclic and the Hochschild homology and cohomology of generic and 3-Calabi-Yau homogeneous down-up algebras. This family was defined by Benkart and Roby in their study of differential posets. Our…
Mazur, Kapranov, Reznikov, and others developed ``Arithmetic Topology,'' a theory describing some surprising analogies between 3-dimensional topology and number theory, which can be summarized by saying that knots are like prime numbers. We…