Related papers: Determinants of modular Collatz graphs and variant…
We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
Important objects of study in $\tau$-tilting theory include the $\tau$-tilting pairs over an algebra on the form $kQ/I$, with $kQ$ being a path algebra and $I$ an admissible ideal. In this paper, we study aspects of the combinatorics of…
The subfactor approach to modular invariants gives insight into the fusion rule structure of the modular invariants.
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
We define an operation of jets on graphs inspired by the corresponding notion in commutative algebra and algebraic geometry. We examine a few graph theoretic properties and invariants of this construction, including chromatic numbers,…
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric…
The purpose of this paper is to describe asymptotic formulas for determinants of certain operators that are analogues of Wiener-Hopf operators. The determinant formulas yield information about the distribution functions for certain random…
In this paper, we establish the sharp bounds of certain Toeplitz determinants formed over the coefficients of mappings from a class defined on the unit ball of complex Banach space and on the unit polydisc in $\mathbb{C}^n$. Derived bounds…
From the irreducible decompositions' point of view, the structure of the cyclic $GL_n$-module generated by the $\alpha$-determinant degenerates when $\alpha=\pm \frac1k (1\leq k\leq n-1)$. In this paper, we show that $-\frac1k$-determinant…
Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…
Taking a new approach towards analyzing the Collatz Problem, or, 3x+1 conjecture. Introducing some new functions, the Collatz-2 and Collatz-3 sequences, as well as deducing results related to Collatz-2 and Collatz-3 sequences.
This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…
We characterize the limiting fluctuations of traces of several independent Wigner matrices and deterministic matrices under mild conditions. A CLT holds but in general the families are not asymptotically free of second order and the…
In this paper, we study polar quotients and \L ojasiewicz exponents of plane curve singularities, which are {\em not necessarily reduced}. We first show that the polar quotients is a topological invariant. We next prove that the \L…
We report on results about a study of algebraic graph invariants, based on computer exploration, and motivated by graph-isomorphism and reconstruction problems.
To each associative unitary finite-dimensional algebra over a normal base, we associative a canonical multiplicative function called its determinant. We give various properties of this construction, as well as applications to the topology…
We define generalized Collatz mappings on free abelian groups of finite rank and study their iteration trajectories. Using geometric arguments we describe cones of points having a divergent trajectory and we deduce lower bounds for the…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…