Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Lee Sang June"'
Publikováno v:
Open Mathematics, Vol 21, Iss 1, Pp 435-441 (2023)
We investigate when there is a partition of a positive integer nn, n=f(λ1)+f(λ2)+⋯+f(λℓ),n=f\left({\lambda }_{1})+f\left({\lambda }_{2})+\cdots +f\left({\lambda }_{\ell }), satisfying that 1=χp(λ1)λ1+χp(λ2)λ2+⋯+χp(λℓ)λℓ,1=\frac{
Externí odkaz:
https://doaj.org/article/d29bc3774e0b48ab9c5bed2362314153
Autor:
Lee, Sang June, Oh, Jun Seok
Publikováno v:
Discrete Appl. Math. 330 (2023), 118 - 127
Let $C_n$ be a cyclic group of order $n$. A sequence $S$ of length $\ell$ over $C_n$ is a sequence $S = a_1\boldsymbol\cdot a_2\boldsymbol\cdot \ldots\boldsymbol\cdot a_{\ell}$ of $\ell$ elements in $C_n$, where a repetition of elements is allowed an
Externí odkaz:
http://arxiv.org/abs/2003.02511
Autor:
Lee, Sang June, Oh, Jun Seok
Publikováno v:
In Discrete Applied Mathematics 15 May 2023 330:118-127
Publikováno v:
European Journal of Combinatorics Volume 82, December 2019, 102993
Two families, ${\mathcal A}$ and ${\mathcal B}$, of subsets of $[n]$ are cross $t$-intersecting if for every $A \in {\mathcal A}$ and $B \in {\mathcal B}$, $A$ and $B$ intersect in at least $t$ elements. For a real number $p$ and a family ${\mathcal
Externí odkaz:
http://arxiv.org/abs/1807.02252
Publikováno v:
In Journal of Combinatorial Theory, Series A October 2021 183
Autor:
Lee, Sang June, Lefmann, Hanno
We prove the following: Fix an integer $k\geq 2$, and let $T$ be a real number with $T\geq 1.5$. Let $\cH=(V,\cE_2\cup \cE_3\cup\dots\cup\cE_k)$ be a non-uniform hypergraph with the vertex set $V$ and the set $\cE_i$ of edges of size $i=2,\ldots , k$
Externí odkaz:
http://arxiv.org/abs/1602.03569
Ahlswede and Khachatrian's diametric theorem is a weighted version of their complete intersection theorem, itself an extension of the $t$-intersecting Erd\H{o}s-Ko-Rado theorem. Their intersection theorem says that the maximum size of a family of sub
Externí odkaz:
http://arxiv.org/abs/1509.02249
When each vertex is assigned a set, the intersection graph generated by the sets is the graph in which two distinct vertices are joined by an edge if and only if their assigned sets have a nonempty intersection. An interval graph is an intersection g
Externí odkaz:
http://arxiv.org/abs/1506.03389
Autor:
Lee, Sang June
For positive integers $d$ and $n$, let $[n]^d$ be the set of all vectors $(a_1,a_2,\dots, a_d)$, where $a_i$ is an integer with $0\leq a_i\leq n-1$. A subset $S$ of $[n]^d$ is called a \emph{Sidon set} if all sums of two (not necessarily distinct) ve
Externí odkaz:
http://arxiv.org/abs/1405.4227
Publikováno v:
In European Journal of Combinatorics December 2019 82