scholarly journals Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 193
Author(s):  
Ruixue Zhang ◽  
Fengming Dong ◽  
Meiqiao Zhang

A mixed hypergraph H is a triple (X,C,D), where X is a finite set and each of C and D is a family of subsets of X. For any positive integer λ, a proper λ-coloring of H is an assignment of λ colors to vertices in H such that each member in C contains at least two vertices assigned the same color and each member in D contains at least two vertices assigned different colors. The chromatic polynomial of H is the graph-function counting the number of distinct proper λ-colorings of H whenever λ is a positive integer. In this article, we show that chromatic polynomials of mixed hypergraphs under certain conditions are zero-free in the intervals (−∞,0) and (0,1), which extends known results on zero-free intervals of chromatic polynomials of graphs and hypergraphs.

1972 ◽  
Vol 24 (3) ◽  
pp. 492-501 ◽  
Author(s):  
Andrew Sobczyk ◽  
James O. Gettys

Let G be a finite graph with non-empty vertex set (G) and edge set (G) (see [2]). Let λ be a positive integer. Tutte [5] defines a λ-colouring of G as a mapping of (G) into the set Iλ = {1, 2, 3, …, λ} with the property that two ends of any edge are mapped onto distinct integers. The elements of Iλ are commonly called “colours.” If P(G, λ) represents the number of λ-colourings of G, it is well known that P(G, λ) can be expressed as a polynomial in λ. For this reason P(G, λ) is usually referred to as the chromatic polynomial of G.The chromatic polynomial P(G, λ) was first suggested as an approach to the four-colour conjecture. To quote Tutte [5]: ”… many people are specially interested in the value λ = 4.


10.37236/4412 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Dae Hyun Kim ◽  
Alexander H. Mun ◽  
Mohamed Omar

Given a group $G$ of automorphisms of a graph $\Gamma$, the orbital chromatic polynomial $OP_{\Gamma,G}(x)$ is the polynomial whose value at a positive integer $k$ is the number of orbits of $G$ on proper $k$-colorings of $\Gamma.$ Cameron and Kayibi introduced this polynomial as a means of understanding roots of chromatic polynomials. In this light, they posed a problem asking whether the real roots of the orbital chromatic polynomial of any graph are bounded above by the largest real root of its chromatic polynomial. We resolve this problem in a resounding negative by not only constructing a counterexample, but by providing a process for generating families of counterexamples. We additionally begin the program of finding classes of graphs whose orbital chromatic polynomials have real roots bounded above by the largest real root of their chromatic polynomials; in particular establishing this for many outerplanar graphs.


Author(s):  
Ben Brubaker ◽  
Daniel Bump ◽  
Solomon Friedberg

This chapter describes Type A Weyl group multiple Dirichlet series. It begins by defining the basic shape of the class of Weyl group multiple Dirichlet series. To do so, the following parameters are introduced: Φ‎, a reduced root system; n, a positive integer; F, an algebraic number field containing the group μ‎₂ₙ of 2n-th roots of unity; S, a finite set of places of F containing all the archimedean places, all places ramified over a ℚ; and an r-tuple of nonzero S-integers. In the language of representation theory, the weight of the basis vector corresponding to the Gelfand-Tsetlin pattern can be read from differences of consecutive row sums in the pattern. The chapter considers in this case expressions of the weight of the pattern up to an affine linear transformation.


2019 ◽  
Vol 31 (1) ◽  
pp. 241-263 ◽  
Author(s):  
Eric Jespers ◽  
Arne Van Antwerpen

Abstract Let {r\colon X^{2}\rightarrow X^{2}} be a set-theoretic solution of the Yang–Baxter equation on a finite set X. It was proven by Gateva-Ivanova and Van den Bergh that if r is non-degenerate and involutive, then the algebra {K\langle x\in X\mid xy=uv\text{ if }r(x,y)=(u,v)\rangle} shares many properties with commutative polynomial algebras in finitely many variables; in particular, this algebra is Noetherian, satisfies a polynomial identity and has Gelfand–Kirillov dimension a positive integer. Lebed and Vendramin recently extended this result to arbitrary non-degenerate bijective solutions. Such solutions are naturally associated to finite skew left braces. In this paper we will prove an analogue result for arbitrary solutions {r_{B}} that are associated to a left semi-brace B; such solutions can be degenerate or can even be idempotent. In order to do so, we first describe such semi-braces and then prove some decompositions results extending those of Catino, Colazzo and Stefanelli.


2012 ◽  
Vol 93 (1-2) ◽  
pp. 85-90 ◽  
Author(s):  
ANDREJ DUJELLA ◽  
FLORIAN LUCA

AbstractWe study positive integers $n$ such that $n\phi (n)\equiv 2\hspace{0.167em} {\rm mod}\hspace{0.167em} \sigma (n)$, where $\phi (n)$ and $\sigma (n)$ are the Euler function and the sum of divisors function of the positive integer $n$, respectively. We give a general ineffective result showing that there are only finitely many such $n$ whose prime factors belong to a fixed finite set. When this finite set consists only of the two primes $2$ and $3$ we use continued fractions to find all such positive integers $n$.


2008 ◽  
Vol 15 (03) ◽  
pp. 457-462 ◽  
Author(s):  
A. Mafi ◽  
H. Saremi

Let R be a commutative Noetherian local ring, 𝔞 an ideal of R, and M a finitely generated generalized f-module. Let t be a positive integer such that [Formula: see text] and t > dim M - dim M/𝔞M. In this paper, we prove that there exists an ideal 𝔟 ⊇ 𝔞 such that (1) dim M - dim M/𝔟M = t; and (2) the natural homomorphism [Formula: see text] is an isomorphism for all i > t and it is surjective for i = t. Also, we show that if [Formula: see text] is a finite set for all i < t, then there exists an ideal 𝔟 of R such that dim R/𝔟 ≤ 1 and [Formula: see text] for all i < t.


1974 ◽  
Vol 26 (4) ◽  
pp. 806-819
Author(s):  
Kenneth W. Lebensold

In this paper, we are concerned with the following problem: Let S be a finite set and Sm* ⊂ 2S a collection of subsets of S each of whose members has m elements (m a positive integer). Let f be a real-valued function on S and, for p ∊ Sm*, define f(P) as Σs∊pf (s). We seek the minimum (or maximum) of the function f on the set Sm*.The Traveling Salesman Problem is to find the cheapest polygonal path through a given set of vertices, given the cost of getting from any vertex to any other. It is easily seen that the Traveling Salesman Problem is a special case of this system, where S is the set of all edges joining pairs of points in the vertex set, Sm* is the set of polygons, each polygon has m elements (m = no. of points in the vertex set = no. of edges per polygon), and f is the cost function.


Algorithms ◽  
2019 ◽  
Vol 12 (8) ◽  
pp. 164
Author(s):  
Eggleton

Let V be a finite set of positive integers with sum equal to a multiple of the integer b. When does V have a partition into b parts so that all parts have equal sums? We develop algorithmic constructions which yield positive, albeit incomplete, answers for the following classes of set V, where n is a given positive integer: (1) an initial interval a∈Z+:a≤n; (2) an initial interval of primes p∈P:p≤n, where P is the set of primes; (3) a divisor set d∈Z+:d|n; (4) an aliquot set d∈Z+:d|n, d<n. Open general questions and conjectures are included for each of these classes.


1967 ◽  
Vol 10 (5) ◽  
pp. 653-658 ◽  
Author(s):  
D.R. Stocks

Moser and Zayachkowski [1] have discussed certain planar lattice paths from (0, 0) to (m, n). In this note we consider analogous paths in three dimensional space. For basic definitions see reference [2]. Throughout this note each of m, n and k is a positive integer and if S is a finite set, |S| will denote the number of elements of S.Each path under consideration here is such that each of its steps is of one of the following types:


2018 ◽  
Vol 27 (6) ◽  
pp. 988-998 ◽  
Author(s):  
THOMAS J. PERRETT ◽  
CARSTEN THOMASSEN

We prove that the roots of the chromatic polynomials of planar graphs are dense in the interval between 32/27 and 4, except possibly in a small interval around τ + 2 where τ is the golden ratio. This interval arises due to a classical result of Tutte, which states that the chromatic polynomial of every planar graph takes a positive value at τ + 2. Our results lead us to conjecture that τ + 2 is the only such number less than 4.


Sign in / Sign up

Export Citation Format

Share Document