Related papers: Decomposable polynomials in second order linear re…

$G$ be a finite group and $A$ a $G$-graded algebra over a field $F$ of characteristic zero. We characterize the varieties of $G$-graded algebras such that the multiplicities $m_{\langle \lambda \rangle}$ appering in the $\langle n \rangle…

A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. Manikandan and Paulraja conjectured that if $G$ and $H$ are Hamilton cycle decomposable circulant graphs with at least one of them is…

We define a broad class of crossed product C*-algebras of the form C(G)xG, where G is a discrete countable amenable residually finite group, and G is a profinite completion of G. We show that they are unital separable simple nuclear…

We construct a complex linear Weil representation $\rho$ of the generalized special linear group $G={\rm SL}_*^{1}(2,A_n)$ ($A_n=K[x]/\langle x^n\rangle$, $K$ the quadratic extension of the finite field $k$ of $q$ elements, $q$ odd), where…

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

The alpha-determinant unifies and interpolates the notion of the determinant and permanent. We determine the irreducible decomposition of the cyclic module of $gl_n(C)$ defined by the alpha-determinant. The degeneracy of the irreducible…

Let X be a non-deterministic infinite exchangeable sequence with values in {0,1}. We show that X is Hoeffding-decomposable if, and only if, X is either an i.i.d. sequence or a Polya sequence. This completes the results established in…

Let N be a normal subgroup of a finite group G and consider the set cd(G|N) of degrees of irreducible characters of G whose kernels do not contain N. A number of theorems are proved relating the set cd(G|N) to the structure of N. For…

Let $G=(V,E)$ be a simple graph with $V=\{1,2,\cdots,n\}$ and $\chi(G,x)$ be its chromatic polynomial. For an ordering $\pi=(v_1,v_2,\cdots,v_n)$ of elements of $V$, let $\delta_G(\pi)$ be the number of $i$'s, where $1\le i\le n-1$, with…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

In this article we establish novel decompositions of Gaussian fields taking values in suitable spaces of generalized functions, and then use these decompositions to prove results about Gaussian multiplicative chaos. We prove two…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

A constant term sequence is a sequence of rational numbers whose $n$-th term is the constant term of $P^n(\boldsymbol{x}) Q(\boldsymbol{x})$, where $P(\boldsymbol{x})$ and $Q(\boldsymbol{x})$ are multivariate Laurent polynomials. While the…

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

We consider probability measures on the real line or unit circle with Jacobi or Verblunsky coefficients satisfying an $\ell^p$ condition and a generalized bounded variation condition. This latter condition requires that a sequence can be…

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

We derive Gamow vectors from S-matrix poles of higher multiplicity in analogy to the Gamow vectors describing resonances from first-order poles. With these vectors we construct a density operator that describes resonances associated with…

For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…

A t by n random matrix A is formed by sampling n independent random column vectors, each containing t components. The random Gram matrix of size n, G_n, contains the dot products between all pairs of column vectors in the randomly generated…

Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…