Module checking of pushdown multi-agent systems
March 7, 2020
| |
Computer Science
Logic in Computer Science
Formal Languages and Automata Theory
Multiagent Systems
In this paper, we investigate the module-checking problem of pushdown
multi-agent systems (PMS) against ATL and ATL* specifications. We establish
that for ATL, module checking of PMS is 2EXPTIME-complete, which is the same
complexity as pus...
On the edge-Erd\H{o}s-P\'{o}sa property of Ladders
March 6, 2020
|
Mathematics
Combinatorics
We prove that the ladder with ~rungs and the house graph have the
edge-Erd\H{o}s-P\'{o}sa property, while ladders with ~rungs or more have
not. Additionally, we prove that the latter bound is optimal in the sense that
the only known ...
Deep Learning-based CSI Feedback for RIS-assisted Multi-user Systems
March 6, 2020
| | | |
Computer Science
Electrical Engineering and Systems Science
Mathematics
Information Theory
Signal Processing
Information Theory
In the realm of reconfigurable intelligent surface (RIS)-assisted wireless
communications, efficient channel state information (CSI) feedback is
paramount. This paper introduces RIS-CoCsiNet, a novel deep learning-based
framework designed t...
The Topology of Local Computing in Networks
March 6, 2020
|
Computer Science
Distributed, Parallel, and Cluster Computing
Modeling distributed computing in a way enabling the use of formal methods is
a challenge that has been approached from different angles, among which two
techniques emerged at the turn of the century: protocol complexes, and directed
algebr...
The planar limit of superconformal field theories
March 5, 2020
| |
Physics
High Energy Physics - Theory
We obtain the perturbative expansion of the free energy on for four
dimensional Lagrangian superconformal field theories, to all
orders in the 't Hooft coupling, in the planar limit. We do so by using
supersymmetric local...
On the stability of open-string orbifold models with broken supersymmetry
March 5, 2020
| |
Physics
High Energy Physics - Theory
We consider an open-string realisation of
spontaneous breaking of supersymmetry in four-dimensional Minkowski spacetime.
It is based on type IIB orientifold theory compactified on $T^2\times
T^4/\mathbb{Z}_2...
Notes on Randomized Algorithms
March 4, 2020
Computer Science
Data Structures and Algorithms
Lecture notes for the Yale Computer Science course CPSC 469/569 Randomized
Algorithms. Suitable for use as a supplementary text for an introductory
graduate or advanced undergraduate course on randomized algorithms. Discusses
tools from pro...
Computing A1-Euler numbers with Macaulay2
March 3, 2020
|
Mathematics
Algebraic Geometry
Algebraic Geometry
We use Macaulay2 for several enriched counts in GW(k). First, we compute the
count of lines on a general cubic surface using Macaulay2 over Fp in GW(Fp) for
p a prime number and over the rational numbers Q in GW(Q). This gives a new
proof f...
Looking through the QCD Conformal Window with Perturbation Theory
March 3, 2020
| | |
Physics
High Energy Physics - Theory
High Energy Physics - Lattice
High Energy Physics - Phenomenology
High Energy Physics - Theory
High Energy Physics - Lattice
High Energy Physics - Phenomenology
We study the conformal window of QCD using perturbation theory, starting from
the perturbative upper edge and going down as much as we can towards the
strongly coupled regime. We do so by exploiting the available five-loop
computation of th...
On Mochizuki's idea of Anabelomorphy and its applications
March 3, 2020
Mathematics
Algebraic Geometry
Number Theory
I coined the term anabelomorphy (pronounced as anabel-o-morphy) as a concise
way of expressing Mochizuki's idea of "anabelian way of changing ground field,
rings etc." which was he has introduced in his work on his Inter-Universal
Teichmull...