Zobrazeno 1 - 10
of 1 794
pro vyhledávání: '"Pham A. Tuan"'
Autor:
Nguyen H. Phuong, Luan D. L. Nguyen, Vu H. M. Nguyen, Vo V. Cuong, Tran M. Tuan, Pham A. Tuan
Publikováno v:
Engineering, Technology & Applied Science Research, Vol 13, Iss 4 (2023)
Daylighting is a future building design trend, subjected to all the global energy efficiency standards, but its design still largely depends on the architect and it is difficult for electrical engineers to precisely quantify the energy efficiency of
Externí odkaz:
https://doaj.org/article/d834057f1f484cffbc55c2842ef453e1
Autor:
Nenadov, Rajko, Pham, Huy Tuan
We present a short and simple proof of the celebrated hypergraph container theorem of Balogh--Morris--Samotij and Saxton--Thomason. On a high level, our argument utilises the idea of iteratively taking vertices of largest degree from an independent s
Externí odkaz:
http://arxiv.org/abs/2408.08514
A family of $r$ distinct sets $\{A_1,\ldots, A_r\}$ is an $r$-sunflower if for all $1 \leqslant i < j \leqslant r$ and $1 \leqslant i' < j' \leqslant r$, we have $A_i \cap A_j = A_{i'} \cap A_{j'}$. Erd\H{o}s and Rado conjectured in 1960 that every f
Externí odkaz:
http://arxiv.org/abs/2408.04165
We present an explicit subset $A\subseteq \mathbb{N} = \{0,1,\ldots\}$ such that $A + A = \mathbb{N}$ and for all $\varepsilon > 0$, \[\lim_{N\to \infty}\frac{\big|\big\{(n_1,n_2): n_1 + n_2 = N, (n_1,n_2)\in A^2\big\}\big|}{N^{\varepsilon}} = 0.\] T
Externí odkaz:
http://arxiv.org/abs/2405.08650
We initiate the systematic study of the following Tur\'an-type question. Suppose $\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$ and $c > 0
Externí odkaz:
http://arxiv.org/abs/2405.05902
Autor:
Conlon, David, Fox, Jacob, He, Xiaoyu, Mubayi, Dhruv, Pham, Huy Tuan, Suk, Andrew, Verstraëte, Jacques
Answering a question of Erd\H{o}s and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive integers each at most $n$ is $2^{(c_x + o(1))n}$ for an explicit const
Externí odkaz:
http://arxiv.org/abs/2404.16016
We consider the problem of algorithmically sampling from the Gibbs measure of a mixed $p$-spin spherical spin glass. We give a polynomial-time algorithm that samples from the Gibbs measure up to vanishing total variation error, for any model whose mi
Externí odkaz:
http://arxiv.org/abs/2404.15651
It is well-known that polynomial versions of theorems of R\"odl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erd\H{o}s-Hajnal conjecture. In this note, we prove that these three conjectures are in
Externí odkaz:
http://arxiv.org/abs/2403.08303
Autor:
Huang, Andris, Melkani, Yash, Calafiura, Paolo, Lazar, Alina, Murnane, Daniel Thomas, Pham, Minh-Tuan, Ju, Xiangyang
Particle tracking is crucial for almost all physics analysis programs at the Large Hadron Collider. Deep learning models are pervasively used in particle tracking related tasks. However, the current practice is to design and train one deep learning m
Externí odkaz:
http://arxiv.org/abs/2402.10239
Autor:
Pham, Michel Tuan (AUTHOR) michel.pham@columbia.edu, Wu, Alisa Yinghao (AUTHOR), Wang, Danqi (AUTHOR)
Publikováno v:
Journal of Consumer Research. Jun2024, Vol. 51 Issue 1, p191-203. 13p.