Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Misha Gavrilovich"'
Autor:
Marina Sandomirskaia, Elena Yanovskaya, Alexander S. Nesterov, Fedor Sandomirskiy, Galina Lyapunova, Egor Ianovski, Hervé Moulin, Anna Bogomolnaia, Misha Gavrilovich
Publikováno v:
International Journal of Game Theory. 50:597-601
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f4dbcf6403482c61c1c69d6440123c1
https://doi.org/10.1007/s00182-021-00770-4
https://doi.org/10.1007/s00182-021-00770-4
Autor:
Misha Gavrilovich
Publikováno v:
Communications in Algebra. 48:1548-1566
We formulate two conjectures about etale cohomology and fundamental groups motivated by categoricity conjectures in model theory. One conjecture says that there is a unique Z-form of the etale coho...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f048137845d69ca6bd951f47c86f8adf
https://doi.org/10.1080/00927872.2019.1691572
https://doi.org/10.1080/00927872.2019.1691572
Autor:
Misha Gavrilovich, Assaf Hasson
Publikováno v:
Israel Journal of Mathematics. 209:15-83
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and infinite e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa49bef1316788a1631c0534ffb963f7
https://doi.org/10.1007/s11856-015-1211-7
https://doi.org/10.1007/s11856-015-1211-7
Publikováno v:
Journal of Logic and Computation. 25:669-682
In this note we interpret Voevodsky's Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category $Qt$ in which the mapping $Hom^{(w)}(Z\times B,C):Qt\longrightarrow Sets$ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d9ca693167d4c0f1bd3635f9f4e6f0c
https://doi.org/10.1093/logcom/exu022
https://doi.org/10.1093/logcom/exu022
Publikováno v:
International Mathematics Research Notices. 2014:3975-4000
Let $S$ be a semiabelian variety over an algebraically closed field, and let $X$ be an irreducible subvariety not contained in a coset of a proper algebraic subgroup of $S$. We show that the number of irreducible components of $[n]^{-1}(X)$ is bounde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a207dc4463341117d84d9f42794c3fc
https://doi.org/10.1093/imrn/rnt057
https://doi.org/10.1093/imrn/rnt057
Autor:
Misha Gavrilovich
Publikováno v:
Annals of Pure and Applied Logic. 163:1524-1548
We use tools of mathematical logic to analyse the notion of a path on a complex algebraic variety, and are led to formulate a “rigidity” property of fundamental groups specific to algebraic varieties, as well as to define a bona fide topology clo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abfcba3ef149d36906eca10784653572
https://doi.org/10.1016/j.apal.2011.12.007
https://doi.org/10.1016/j.apal.2011.12.007
Autor:
Victoria L. Kreps, Misha Gavrilovich
Publikováno v:
International Game Theory Review. 20:1750034
We consider random public signals on the state of two-person zero-sum game with incomplete information on both sides (both players do not know the state of the game). To learn the state, each player chooses a finite automaton which receives the publi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::095b726a66e78e24994301a5ecec8325
https://doi.org/10.1142/s0219198917500347
https://doi.org/10.1142/s0219198917500347
Autor:
Misha Gavrilovich
Publikováno v:
K-Theory. 38:135-152
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d9685bcb95d46b528b15d8a0dfc740a
https://doi.org/10.1007/s10977-007-9015-0
https://doi.org/10.1007/s10977-007-9015-0
Autor:
Victoria L. Kreps, Misha Gavrilovich
Publikováno v:
SSRN Electronic Journal.
It is well-known that large random structures may have non-random macroscopic properties. We give an example of non-random properties for a class of large optimization problems related to the computational problem MAXFLS^= of calculating the maximal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c189deb742e1af8ce5c46abb748761e7
https://doi.org/10.2139/ssrn.2693527
https://doi.org/10.2139/ssrn.2693527