Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Fedor Petrov"'
Autor:
Benjamin Lovitz, Fedor Petrov
Publikováno v:
Forum of Mathematics, Sigma, Vol 11 (2023)
Kruskal’s theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a ‘splitting theorem’ for sets of product tensors, in which the k-rank con
Externí odkaz:
https://doaj.org/article/d252b513e93642f593adf5872a3eb1fc
Autor:
Stanisław Cichomski, Fedor Petrov
Publikováno v:
Electronic Communications in Probability. 28
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db709a46c888822f27c3f982e0591fda
https://doi.org/10.1214/23-ecp512
https://doi.org/10.1214/23-ecp512
Publikováno v:
Problems of Archaeology, Ethnography, Anthropology of Siberia and Neighboring Territories. 27:419-426
The Andreevskoye settlement (Bredinsky district of the Chelyabinsk Region, the left bank of the Sintashta River of the Tobolsk basin) belongs to a rare type of sites of the Trans-Ural Bronze Age with dense housing development, enclosed by a system of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88fe164ce3b1d35a1d3fa8ddd6ae8753
https://doi.org/10.17746/2658-6193.2021.27.0419-0426
https://doi.org/10.17746/2658-6193.2021.27.0419-0426
Autor:
Ivan Bochkov, Fedor Petrov
Publikováno v:
Order. 38:323-328
Let $(\mathcal {P},\leqslant )$ be a finite poset. Define the numbers a1,a2,… (respectively, c1,c2,…) so that a1 + … + ak (respectively, c1 + … + ck) is the maximal number of elements of $\mathcal {P}$ which may be covered by k antichains (re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee4c00dd77e91ac90243889fa1d044af
https://doi.org/10.1007/s11083-020-09542-3
https://doi.org/10.1007/s11083-020-09542-3
Autor:
Alexander Tarasov, Fedor Petrov
Publikováno v:
Arnold Mathematical Journal. 6:163-171
Let $${\mathcal {E}}$$ be an ellipsoid in $${\mathbb {R}}^n$$ . Gusakova and Zaporozhets conjectured that $${\mathcal {E}}$$ is uniquely (up to rigid motions) determined by its intrinsic volumes. We prove this conjecture for $$n = 3$$ .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c1748de2d10d0239b5a4937f688687c
https://doi.org/10.1007/s40598-020-00137-9
https://doi.org/10.1007/s40598-020-00137-9
Autor:
Fedor Petrov, Danila Cherkashin
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:1326-1333
Let $m(n,r)$ denote the minimal number of edges in an $n$-uniform hypergraph which is not $r$-colorable. It is known that for a fixed $n$ one has $c_n r^n < m(n,r) < C_n r^n$. We prove that for any...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf0b2ed3a4d5006d0f669e31f7af7796
https://doi.org/10.1137/19m1281861
https://doi.org/10.1137/19m1281861
Autor:
Zhi-Wei Sun, Fedor Petrov
Publikováno v:
Electronic Research Archive. 28:589-597
We confirm several conjectures of Sun involving quadratic residues modulo odd primes. For any prime $p\equiv 1\pmod 4$ and integer $a\not\equiv0\pmod p$, we prove that \begin{align*}&(-1)^{|\{1\le k\{ak^2\}_p\right\}\right| \\&+\left|\left\{(j,k):\ 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b372738b07809ea8d0eb8f9f49eabb5f
https://doi.org/10.3934/era.2020031
https://doi.org/10.3934/era.2020031
Autor:
Marion Merklein, Philipp Frey, Simon Wituschek, Fedor Petrov, Michael Lechner, Alexander Arzhanov, Tassilo Christ
Publikováno v:
wt Werkstattstechnik online. 110:704-708
Die Verfolgung von Bauteilen und Zwischenprodukten sowie die Erfassung eines vollständigen Produktionsdatensatzes sind in modernen Fertigungsketten eine wichtige Voraussetzung für die durchgängig digitale Produktion. Dieser Beitrag stellt die Lös
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cfae234bb94626745f7dde856c20778
https://doi.org/10.37544/1436-4980-2020-10-60
https://doi.org/10.37544/1436-4980-2020-10-60
Publikováno v:
European Journal of Combinatorics. :103697
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f35c2a04dc0719264c5384e0d0aac38
https://doi.org/10.1016/j.ejc.2023.103697
https://doi.org/10.1016/j.ejc.2023.103697
Autor:
Danila Cherkashin, Fedor Petrov
Publikováno v:
Journal of Combinatorial Theory, Series B. 139:353-359
A two-coloring of the vertices V of the hypergraph H = ( V , E ) by red and blue has discrepancy d if d is the largest difference between the number of red and blue points in any edge. Let f ( n ) be the fewest number of edges in an n-uniform hypergr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c0e8d980ba253a5e234f3b843d736e4
https://doi.org/10.1016/j.jctb.2019.04.001
https://doi.org/10.1016/j.jctb.2019.04.001