Zobrazeno 1 - 10
of 126
pro vyhledávání: '"TEODORESCU, Răzvan"'
This article extends the known restricted isometric projection of sparse datasets in Euclidean spaces $\mathbb{R}^N$ down into low-dimensional subspaces $\mathbb{R}^k, k \ll N,$ to the case of low-dimensional varieties $\mathcal{M} \subset \mathbb{R}
Externí odkaz:
http://arxiv.org/abs/2405.06200
Autor:
Teodorescu, Razvan
Publikováno v:
2019 J. Phys.: Conf. Ser. 1194 012105
This note expands on the recent proof \cite{ABKT} that the extremal domains for analytic content in two dimensions can only be disks and annuli. This result's unexpected implication for theoretical physics is that, for extremal domains, the analytic
Externí odkaz:
http://arxiv.org/abs/2405.06171
Autor:
Teodorescu, Razvan
Publikováno v:
Math. Model. Nat. Phenom. 15 (2020) 9
The Laplacian Growth (LG) model is known as a universality class of scale-free aggregation models in two dimensions, characterized by classical integrability and featuring finite-time boundary singularity formation. A discrete counterpart, Diffusion-
Externí odkaz:
http://arxiv.org/abs/2405.06167
Publikováno v:
Expositiones Mathematicae Volume 39, Issue 2, June 2021, pp. 182-196
We discuss several results in electrostatics: Onsager's inequality, an extension of Earnshaw's theorem, and a result stemming from the celebrated conjecture of Maxwell on the number of points of electrostatic equilibrium. Whenever possible, we try to
Externí odkaz:
http://arxiv.org/abs/2003.07751
We review the zeta-function representation of codewords allowed by a parity-check code based on a bipartite graph, and then investigate the effect of disorder on the effective distribution of codewords. The randomness (or disorder) is implemented by
Externí odkaz:
http://arxiv.org/abs/1902.05786
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic graph, it
Externí odkaz:
http://arxiv.org/abs/1512.09193
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hotalen, Bryce, Teodorescu, Razvan
It is widely recognized that the main difficulty in designing devices which could process information using quantum states is due to the decoherence of local excitations about a ground state. A solution to this problem was suggested in \cite{Kitaev},
Externí odkaz:
http://arxiv.org/abs/1501.00132
Autor:
Teodorescu, Razvan
A topological constraint on the possible values of the universal quantization parameter is revealed in the case of geometric quantization on (boundary) curves diffeomorphic to $S^1$, analytically extended on a bounded domain in $\mathbb{C}$, with $n
Externí odkaz:
http://arxiv.org/abs/1412.7716