Related papers: The structure and classification of mis\`ere quoti…
We determine all isomorphism classes of hyperfields of a given finite order which can be obtained as quotients of finite fields of sufficiently large order. Using this result, we determine which hyperfields of order at most 4 are quotients…
Differential modules over a commutative differential ring R which are finitely generated projective as ring modules, with differential homomorphisms, form an additive category, so their isomorphism classes form a monoid. We study the…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
Let $\mathsf{Q}$ be a commutative and unital quantale. By a $\mathsf{Q}$-map we mean a left adjoint in the quantaloid of sets and $\mathsf{Q}$-relations, and by a partial $\mathsf{Q}$-map we refer to a Kleisli morphism with respect to the…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes.…
For any class $\mathcal{C}$ of bipartite graphs, we define quasi-$\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\cal C$. This definition is motivated by a generalisation of the switch Markov chain…
For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…
In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at…
The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…
A method is proposed to characterize and quantify multipartite entanglement in terms of the probability density function of bipartite entanglement over all possible balanced bipartitions of an ensemble of qubits. The method is tested on a…
In these notes we develop some basic theory of idempotents in monoidal categories. We introduce and study the notion of a pair of complementary idempotents in a triangulated monoidal category, as well as more general idempotent…
A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…
Our previous work about algebraic-geometric invariants of the mixed states are extended and a stronger separability criterion is given. We also show that the Schmidt number of pure states in bipartite quantum systems, a classical concept,…
Fully entangled fraction is a definition for bipartite states, which is tightly related to bipartite maximally entangled states, and has clear experimental and theoretical significance. In this work, we generalize it to multipartite case,…