Related papers: Some Arithmetic Properties of Complex Local System…
We prove a number of results on the \'etale cohomology of rigid analytic varieties over $p$-adic non-archimedean local fields. Among other things, we establish bounds for Frobenius eigenvalues, show a strong version of Grothendieck's local…
Complex systems have become a popular lens for analyzing cities and complexity theory has many implications for urban performance and resilience. This paper develops a typology of measures and indicators for assessing the physical…
We describe complex conjugation on the primitive middle-dimensional algebraic de Rham cohomology of a smooth projective hypersurface defined over a number field that admits a real embedding. We use Griffiths' description of the cohomology…
Given a semisimple group over a complete non-Archimedean field, it is well known that techniques from non-Archimedean analytic geometry provide an embedding of the corresponding Bruhat-Tits builidng into the analytic space associated to the…
Approximate Membership Query structures (AMQs) rely on randomisation for time- and space-efficiency, while introducing a possibility of false positive and false negative answers. Correctness proofs of such structures involve subtle…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We show that closed subsets of the character variety of a complex variety with negatively weighted homology, which are $p$-adically integral and Galois invariant, are motivic. Final version: Cambridge Journal of Mathematics
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
An \emph{$\omega$-admissible almost complex structure} on a $2n$-dimensional symplectic manifold $(M,\omega)$ is a $\omega$-calibrated almost complex structure $J$ admitting a nowhere vanishing $\bar{\partial}_J$-closed $(n,0)$-form $\psi$.…
We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…
Grothendieck defined a group that represents the local obstruction for an abelian variety to have semi-stable reduction. These groups were studied by Silverberg and Zarhin and more recently by the author in order to give a group theoretic…
The central aim of this monograph is to provide decomposition results for quasi-coherent sheaves on the moduli stack of one-dimensional formal groups. These results will be based on the geometry of the stack itself, particularly the height…
We review several statistical complexity measures proposed over the last decade and a half as general indicators of structure or correlation. Recently, Lopez-Ruiz, Mancini, and Calbet [Phys. Lett. A 209 (1995) 321] introduced another…
The classical theory of $G$-structures, which include almost-complex structures, explains the relationship between the curvature of compatible connections and integrability. This note is an effort to understand how the curvature of…
Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…
We study properties related to nice enumerability of countably categorical structures and properties related to extreme amenability of automorphism groups of these structures. The text substantially differs from the previous version. In…
We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over…
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for…
Complex systems have motivated continuing interest from the scientific community, leading to new concepts and methods. Growing systems represent a case of particular interest, as their topological, geometrical, and also dynamical properties…
We survey the application of a relatively new branch of statistical physics--"community detection"-- to data mining. In particular, we focus on the diagnosis of materials and automated image segmentation. Community detection describes the…