Results 31 to 40 of about 94,460 (146)

The construction of graphs with irreducible matching polynomials and their generalizations

AKCE International Journal of Graphs and Combinatorics
This paper investigates methods for constructing graphs whose matching polynomials are irreducible over [Formula: see text]. Building on this, the construction method is extended to general graph polynomials, for graphs whose polynomials satisfy certain ...
Hou Shengzhe
doaj   +1 more source

Square-free values of reducible polynomials

Discrete Analysis, 2016
Square-free values of reducible polynomials, Discrete Analysis, 2016:8, 18 pp. When does a polynomial with integer coefficients take infinitely many prime values? An obvious necessary condition is that it should be irreducible, and another is that there
Andrew R. Booker, T. D. Browning
doaj   +1 more source

A max-flow algorithm for positivity of Littlewood-Richardson coefficients [PDF]

Discrete Mathematics & Theoretical Computer Science, 2009
Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group $\mathrm{GL}(n,\mathbb{C})$.
Peter Bürgisser, Christian Ikenmeyer
doaj   +1 more source

Computing the bound of an Ore polynomial. Applications to factorization

, 2018
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization ...
Gomez-Torrecillas, Jose, Lobillo, F. J., Navarro, Gabriel   +2 more
core   +1 more source

Irreducibility of multivariate polynomials

Journal of Computer and System Sciences, 1985
This paper deals with the problem of computing the degrees and multiplicities of the irreducible factors of a given multivariate polynomial. This includes the important question of testing for irreducibility. A probabilistic reduction from multivariate to bivariate polynomials is given, over an arbitrary (effectively computable) field.
openaire   +1 more source

Irreducibility of extensions of Laguerre polynomials [PDF]

Functiones et Approximatio Commentarii Mathematici, 2020
For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $α=u$ with $1\leq u \leq 50$ or $α=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $ψ_n^{(α)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an explicit finite set of pairs $(u,n)$. Furthermore all the exceptions other than $n=2^{12},α=89/2$ are necessary.
Laishram, Shanta, Nair, Saranya G., Shorey, Tarlok N.   +2 more
openaire   +3 more sources

Emergent Spin Hall Quantization and High‐Order van Hove singularities in Square‐Octagonal MA2Z4

Advanced Physics Research, EarlyView.
Square‐octagonal MA2Z4 (M = Mo/W, A = Si/Ge, Z = pnictogen) monolayers are predicted to realize quantum spin Hall insulators with nearly quantized spin Hall conductivity enabled by an emergent spin U(1) quasi‐symmetry. Materials with Z = As and Sb host quasi‐flat bands with high‐order van Hove singularities near the Fermi level, making them promising ...
Rahul Verma, Yash Vardhan, Hsin Lin, Bahadur Singh   +3 more
wiley   +1 more source

Nearly irreducibility of polynomials and the Newton diagrams

Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica, 2020
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C2.
Mateusz Masternak
doaj  

On the irreducibility of a class of polynomials, III

Journal of Number Theory, 1982
[Part III, cf. J. Number Theory 15, 164-181 (1982; Zbl 0509.12001).] Let \(g\in\mathbb{Z}[x]\) be a monic irreducible polynomial such that its splitting field is a totally imaginary quadratic extension of a totally real algebraic number field. It is proved in this paper that apart from possible exceptional polynomials \(f(x)\), there are only finitely ...
openaire   +2 more sources

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source