Displaying similar documents to “The Dichromatic Number of Infinite Families of Circulant Tournaments”

On the heterochromatic number of circulant digraphs

Hortensia Galeana-Sánchez, Víctor Neumann-Lara (2004)

Discussiones Mathematicae Graph Theory

Similarity:

The heterochromatic number hc(D) of a digraph D, is the minimum integer k such that for every partition of V(D) into k classes, there is a cyclic triangle whose three vertices belong to different classes. For any two integers s and n with 1 ≤ s ≤ n, let D n , s be the oriented graph such that V ( D n , s ) is the set of integers mod 2n+1 and A ( D n , s ) = ( i , j ) : j - i 1 , 2 , . . . , n s . . In this paper we prove that h c ( D n , s ) 5 for n ≥ 7. The bound is tight since equality holds when s ∈ n,[(2n+1)/3].

L p inequalities for the growth of polynomials with restricted zeros

Nisar A. Rather, Suhail Gulzar, Aijaz A. Bhat (2022)

Archivum Mathematicum

Similarity:

Let P ( z ) = ν = 0 n a ν z ν be a polynomial of degree at most n which does not vanish in the disk | z | < 1 , then for 1 p < and R > 1 , Boas and Rahman proved P ( R z ) p ( R n + z p / 1 + z p ) P p . In this paper, we improve the above inequality for 0 p < by involving some of the coefficients of the polynomial P ( z ) . Analogous result for the class of polynomials P ( z ) having no zero in | z | > 1 is also given.

On the topology of polynomials with bounded integer coefficients

De-Jun Feng (2016)

Journal of the European Mathematical Society

Similarity:

For a real number q > 1 and a positive integer m , let Y m ( q ) : = i = 0 n ϵ i q i : ϵ i 0 , ± 1 , ... , ± m , n = 0 , 1 , ... . In this paper, we show that Y m ( q ) is dense in if and only if q < m + 1 and q is not a Pisot number. This completes several previous results and answers an open question raised by Erdös, Joó and Komornik [8].

Self-diclique circulant digraphs

Marietjie Frick, Bernardo Llano, Rita Zuazua (2015)

Mathematica Bohemica

Similarity:

We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let D = ( V , A ) be a reflexive digraph (or network). Consider X and Y (not necessarily disjoint) nonempty subsets of vertices (or nodes) of D . A disimplex K ( X , Y ) of D is...

A note on a conjecture on niche hypergraphs

Pawaton Kaemawichanurat, Thiradet Jiarasuksakun (2019)

Czechoslovak Mathematical Journal

Similarity:

For a digraph D , the niche hypergraph N ( D ) of D is the hypergraph having the same set of vertices as D and the set of hyperedges E ( N ( D ) ) = { e V ( D ) : | e | 2 and there exists a vertex v such that e = N D - ( v ) or e = N D + ( v ) } . A digraph is said to be acyclic if it has no directed cycle as a subdigraph. For a given hypergraph , the niche number n ^ ( ) is the smallest integer such that together with n ^ ( ) isolated vertices is the niche hypergraph of an acyclic digraph. C. Garske, M. Sonntag and H. M. Teichert (2016) conjectured that for a linear...

Majority choosability of 1-planar digraph

Weihao Xia, Jihui Wang, Jiansheng Cai (2023)

Czechoslovak Mathematical Journal

Similarity:

A majority coloring of a digraph D with k colors is an assignment π : V ( D ) { 1 , 2 , , k } such that for every v V ( D ) we have π ( w ) = π ( v ) for at most half of all out-neighbors w N + ( v ) . A digraph D is majority k -choosable if for any assignment of lists of colors of size k to the vertices, there is a majority coloring of D from these lists. We prove that if U ( D ) is a 1-planar graph without a 4-cycle, then D is majority 3-choosable. And we also prove that every NIC-planar digraph is majority 3-choosable.

On the tree structure of the power digraphs modulo n

Amplify Sawkmie, Madan Mohan Singh (2015)

Czechoslovak Mathematical Journal

Similarity:

For any two positive integers n and k 2 , let G ( n , k ) be a digraph whose set of vertices is { 0 , 1 , ... , n - 1 } and such that there is a directed edge from a vertex a to a vertex b if a k b ( mod n ) . Let n = i = 1 r p i e i be the prime factorization of n . Let P be the set of all primes dividing n and let P 1 , P 2 P be such that P 1 P 2 = P and P 1 P 2 = . A fundamental constituent of G ( n , k ) , denoted by G P 2 * ( n , k ) , is a subdigraph of G ( n , k ) induced on the set of vertices which are multiples of p i P 2 p i and are relatively prime to all primes q P 1 . L. Somer and M. Křížek proved that the trees attached...

Recent results on stationary critical Kirchhoff systems in closed manifolds

Emmanuel Hebey, Pierre-Damien Thizy (2013-2014)

Séminaire Laurent Schwartz — EDP et applications

Similarity:

We report on results we recently obtained in Hebey and Thizy [11, 12] for critical stationary Kirchhoff systems in closed manifolds. Let ( M n , g ) be a closed n -manifold, n 3 . The critical Kirchhoff systems we consider are written as a + b j = 1 p M | u j | 2 d v g Δ g u i + j = 1 p A i j u j = U 2 - 2 u i for all i = 1 , , p , where Δ g is the Laplace-Beltrami operator, A is a C 1 -map from M into the space M s p ( ) of symmetric p × p matrices with real entries, the A i j ’s are the components of A , U = ( u 1 , , u p ) , | U | : M is the Euclidean norm of U , 2 = 2 n n - 2 is the critical Sobolev exponent, and...

Signed domination and signed domatic numbers of digraphs

Lutz Volkmann (2011)

Discussiones Mathematicae Graph Theory

Similarity:

Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → -1,1 be a two-valued function. If x N ¯ [ v ] f ( x ) 1 for each v ∈ V(D), where N¯[v] consists of v and all vertices of D from which arcs go into v, then f is a signed dominating function on D. The sum f(V(D)) is called the weight w(f) of f. The minimum of weights w(f), taken over all signed dominating functions f on D, is the signed domination number γ S ( D ) of D. A set f , f , . . . , f d of signed dominating functions on D with the property that...

Critical points of the Moser-Trudinger functional on a disk

Andrea Malchiodi, Luca Martinazzi (2014)

Journal of the European Mathematical Society

Similarity:

On the unit disk B 1 2 we study the Moser-Trudinger functional E ( u ) = B 1 e u 2 - 1 d x , u H 0 1 ( B 1 ) and its restrictions E | M Λ , where M Λ : = { u H 0 1 ( B 1 ) : u H 0 1 2 = Λ } for Λ > 0 . We prove that if a sequence u k of positive critical points of E | M Λ k (for some Λ k > 0 ) blows up as k , then Λ k 4 π , and u k 0 weakly in H 0 1 ( B 1 ) and strongly in C loc 1 ( B ¯ 1 { 0 } ) . Using this fact we also prove that when Λ is large enough, then E | M Λ has no positive critical point, complementing previous existence results by Carleson-Chang, M. Struwe and Lamm-Robert-Struwe.

Existence and multiplicity of solutions for a p ( x ) -Kirchhoff type problem via variational techniques

A. Mokhtari, Toufik Moussaoui, D. O’Regan (2015)

Archivum Mathematicum

Similarity:

This paper discusses the existence and multiplicity of solutions for a class of p ( x ) -Kirchhoff type problems with Dirichlet boundary data of the following form - a + b Ω 1 p ( x ) | u | p ( x ) d x div ( | u | p ( x ) - 2 u ) = f ( x , u ) , i n Ω u = 0 o n Ω , where Ω is a smooth open subset of N and p C ( Ω ¯ ) with N < p - = inf x Ω p ( x ) p + = sup x Ω p ( x ) < + , a , b are positive constants and f : Ω ¯ × is a continuous function. The proof is based on critical point theory and variable exponent Sobolev space theory.

Global analytic and Gevrey surjectivity of the Mizohata operator D 2 + i x 2 2 k D 1

Lamberto Cattabriga, Luisa Zanghirati (1990)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

The surjectivity of the operator D 2 + i x 2 2 k D 1 from the Gevrey space E s R 2 , s 1 , onto itself and its non-surjectivity from E s R 3 to E s R 3 is proved.