Related papers: Classification Theory and the Construction of PAC …
We investigate existentially closed models (of a quite arbitrary theory) equipped which an action of a fixed group G. We embed these structures in a monster model D of some well-rounded theory and describe them as PAC substructures of D.…
This work introduces adelic constructions of direct images of differentials and symbols in the two-dimensional case in the relative situation. In particular, reciprocity laws for relative residues of differentials and symbols are stated and…
Following the philosophy of arithmetic topology, we describe a point of view which helps look at surfaces and $p$-adic fields in a "uniform way", and show that results on mapping class groups can be extended to this point of view, and thus…
We describe a new construction of families of Galois coverings of the line using basic properties of configuration spaces, covering theory, and the Grauert-Remmert Extension Theorem. Our construction provides an alternative to a previous…
Using tensor categories, we present new constructions of several of the exceptional simple Lie superalgebras with integer Cartan matrix in characteristic $p = 3$ and $p = 5$ from the complete classification of modular Lie superalgebras with…
We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…
Given a field F, one may ask which finite groups are Galois groups of field extensions E/F such that E is a maximal subfield of a division algebra with center F. This question was originally posed by Schacher, who gave partial results over…
Path graphs are intersection graphs of paths in a tree.~In this paper we give a "6\ good characterization" of path graphs, namely, we prove that path graph membership is in $NP\cap CoNP$ without resorting to existing polynomial time…
We investigate the maximum size of graph families on a common vertex set of cardinality $n$ such that the symmetric difference of the edge sets of any two members of the family satisfies some prescribed condition. We solve the problem…
We study $t$-designs of parameters $(n,k,\lambda)$ over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph $G$ whose vertex set of size $n$ is partitioned into…
A manifold $M^n$ inherits a labeled $n$-dimensional graph $\widetilde{M}[G^L]$ structure consisting of its charts. This structure enables one to characterize fundamental groups of manifolds, classify those of locally compact manifolds with…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…
In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…
In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…