Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Varga, Dániel"'
Assume two finite families $\mathcal A$ and $\mathcal B$ of convex sets in $\mathbb{R}^3$ have the property that $A\cap B\ne \emptyset$ for every $A \in \mathcal A$ and $B\in \mathcal B$. Is there a constant $\gamma >0$ (independent of $\mathcal A$ a
Externí odkaz:
http://arxiv.org/abs/2409.06472
Autor:
Gábor, Bence, Adwaith, K. V., Varga, Dániel, Sárközi, Bálint, Dombi, András, Clark, T. W., Williams, F. I. B., Nagy, David, Vukics, András, Domokos, Peter
By considering linear scattering of cold atoms inside an undriven high-finesse optical resonator, we experimentally demonstrate effects unique to a strongly coupled vacuum field. Arranging the atoms in an incommensurate lattice, with respect to the r
Externí odkaz:
http://arxiv.org/abs/2408.17079
This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of $n$ vertices using computer search. An unsolved problem of Paul Erd\H{o}s asks the maximum number of edges $u(n)$ a UDG of $n$ vertices can
Externí odkaz:
http://arxiv.org/abs/2406.15317
We prove that the fractional chromatic number $\chi_f(\mathbb{R}^2)$ of the unit distance graph of the Euclidean plane is greater than or equal to $4$. A fundamental ingredient of the proof is the notion of geometric fractional chromatic number $\chi
Externí odkaz:
http://arxiv.org/abs/2311.10069
Autor:
Csiszárik, Adrián, Kiss, Melinda F., Kőrösi-Szabó, Péter, Muntag, Márton, Papp, Gergely, Varga, Dániel
We explore element-wise convex combinations of two permutation-aligned neural network parameter vectors $\Theta_A$ and $\Theta_B$ of size $d$. We conduct extensive experiments by examining various distributions of such model combinations parametrized
Externí odkaz:
http://arxiv.org/abs/2308.11511
By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erd\H{o}s that the density of any measurable planar set avoiding unit distances cannot exceed $1/4$. Our argument implies the upper bound of $0.2470$.
Externí odkaz:
http://arxiv.org/abs/2207.14179
Publikováno v:
SIAM Journal on Discrete Mathematics, 37, no. 3, 1457-1471. (2023)
We consider the minimum number of lines $h_n$ and $p_n$ needed to intersect or pierce, respectively, all the cells of the $n \times n$ chessboard. Determining these values can also be interpreted as a strengthening of the classical plank problem for
Externí odkaz:
http://arxiv.org/abs/2111.09702
We employ a toolset -- dubbed Dr. Frankenstein -- to analyse the similarity of representations in deep neural networks. With this toolset, we aim to match the activations on given layers of two trained neural networks by joining them with a stitching
Externí odkaz:
http://arxiv.org/abs/2110.14633
Autor:
Varga, Daniel, Talgam, Rina
Publikováno v:
'Atiqot / עתיקות, 2023 Jan 01. 110, 363-384.
Externí odkaz:
https://www.jstor.org/stable/27204919
