相关论文: Characterization of preclones by matrix collection…

It is shown that the category of presheaves of simplicial groupoids and the category of presheaves of 2-groupoids have Quillen closed model structures. Furthermore, their homotopy categories are equivalent to the homotopy categories of…

Many real complex systems cannot be represented by a single network, but due to multiple sub-systems and types of interactions, must be represented as a multiplex network. This is a set of nodes which exist in several layers, with each…

The relationship between the exactness of a first order differential calculus on a comodule algebra $P$ and the Galois property of $P$ is investigated.

We establish a generalized version of the duality between groups and the categories of their representations on sets. Given an abstract symmetric monoidal category $K$ called Galois prekosmos, we define pre-Galois objects in $K$ and study…

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Rooted phylogenetic networks are rooted acyclic digraphs. They are used to model complex evolution where hybridization, recombination and other reticulation events play important roles. A rigorous definition of network compression is…

For the Galois closure $\Xgal$ of a generic projection from a surface $X$, it is believed that $\pi_1(\Xgal)$ gives rise to new invariants of $X$. However, in all examples this group is surprisingly simple. In this article, we offer an…

For a class C of operations on a nonempty base set A, an operation f is called a C-subfunction of an operation g, if f = g(h_1, ..., h_n), where all the inner functions h_i are members of C. Two operations are C-equivalent if they are…

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

Euler systems are certain compatible families of cohomology classes, which play a key role in studying the arithmetic of Galois representations. We briefly survey the known Euler systems, and recall a standard conjecture of Perrin-Riou…

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections using proof assistants remains limited to…

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections remains limited to restricted modes of…

Modular categories are important algebraic structures in a variety of subjects in mathematics and physics. We provide an explicit, motivated and elementary definition of a modular category over a field of characteristic 0 as an equivalence…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

In this paper, we study modular categories whose Galois group actions on their simple objects are transitive. We show that such modular categories admit unique factorization into prime transitive factors. The representations of…

Quantum entanglement, a cornerstone of quantum mechanics, remains challenging to classify, particularly in multipartite systems. Here, we present a new interpretation of entanglement classification by revealing a profound connection to…

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

For a typical Scene Graph Generation (SGG) method, there is often a large gap in the performance of the predicates' head classes and tail classes. This phenomenon is mainly caused by the semantic overlap between different predicates as well…

We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…