Related papers: On the primality of totally ordered $q$-factorizat…
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
Kang et al. provided a path realization of the crystal graph of a highest weight module over a quantum affine algebra, as certain semi-infinite tensor products of a single perfect crystal. In this paper, this result is generalized to give a…
The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…
A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
We show that the different labelings of the crystal graph for irreducible highest weight $\mathcal{U}\_q (\hat{\mathfrak{sl}}\_e)$-modules lead to different labelings of the simple modules for non semisimple Ariki-Koike algebras by using…
In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art…
For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…
Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…
In this paper, we study arbitrary models of the first-order theory of a ring $A$ where the additive group $A$ is a finitely generated abelian group. Following an earlier paper by this author, Alexei G. Myasnikov and Francis Oger, we call…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We give a diagrammatic presentation of the category of $\textbf{U}_q(\mathfrak{sl}_2)$-tilting modules $\mathfrak{T}$ for $q$ being a root of unity and introduce a grading on $\mathfrak{T}$. This grading is a "root of unity phenomenon" and…
This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…