Displaying similar documents to “Circles passing through five or more integer points”

Kannan-type cyclic contraction results in 2 -Menger space

Binayak S. Choudhury, Samir Kumar BHANDARI (2016)

Mathematica Bohemica

Similarity:

In this paper we establish Kannan-type cyclic contraction results in probabilistic 2-metric spaces. We use two different types of t -norm in our theorems. In our first theorem we use a Hadzic-type t -norm. We use the minimum t -norm in our second theorem. We prove our second theorem by different arguments than the first theorem. A control function is used in our second theorem. These results generalize some existing results in probabilistic 2-metric spaces. Our results are illustrated with...

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].

Cyclic Type Fixed Point Results in 2-Menger Spaces

Binayak S. CHOUDHURY, Samir Kumar BHANDARI, Parbati SAHA (2015)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

In this paper we introduce generalized cyclic contractions through r number of subsets of a probabilistic 2-metric space and establish two fixed point results for such contractions. In our first theorem we use the Hadzic type t -norm. In another theorem we use a control function with minimum t -norm. Our results generalizes some existing fixed point theorem in 2-Menger spaces. The results are supported with some examples.

On the Rockafellar theorem for Φ γ ( · , · ) -monotone multifunctions

S. Rolewicz (2006)

Studia Mathematica

Similarity:

Let X be an arbitrary set, and γ: X × X → ℝ any function. Let Φ be a family of real-valued functions defined on X. Let Γ : X 2 Φ be a cyclic Φ γ ( · , · ) -monotone multifunction with non-empty values. It is shown that the following generalization of the Rockafellar theorem holds. There is a function f: X → ℝ such that Γ is contained in the Φ γ ( · , · ) -subdifferential of f, Γ ( x ) Φ γ ( · , · ) f | x .

A note on another construction of graphs with 4 n + 6 vertices and cyclic automorphism group of order 4 n

Peteris Daugulis (2017)

Archivum Mathematicum

Similarity:

The problem of finding minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic groups. This problem was considered earlier by other authors. We give a construction of an undirected graph having 4 n + 6 vertices and automorphism group cyclic of order 4 n , n 1 . As a special case we get graphs with 2 k + 6 vertices and cyclic automorphism groups of order 2 k . It can revive interest in related problems.

Note on cyclic decompositions of complete bipartite graphs into cubes

Dalibor Fronček (1999)

Discussiones Mathematicae Graph Theory

Similarity:

So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes Q d of a given dimension d was K d 2 d - 1 , d 2 d - 2 . We improve this result and show that also K d 2 d - 2 , d 2 d - 2 allows a cyclic decomposition into Q d . We also present a cyclic factorization of K 8 , 8 into Q₄.

A characterization of Eisenstein polynomials generating extensions of degree p 2 and cyclic of degree p 3 over an unramified 𝔭 -adic field

Maurizio Monge (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let p 2 be a prime. We derive a technique based on local class field theory and on the expansions of certain resultants allowing to recover very easily Lbekkouri’s characterization of Eisenstein polynomials generating cyclic wild extensions of degree p 2 over p , and extend it to when the base fields K is an unramified extension of p . When a polynomial satisfies a subset of such conditions the first unsatisfied condition characterizes the Galois group of the normal closure. We...

Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials

Didier D'Acunto, Krzysztof Kurdyka (2005)

Annales Polonici Mathematici

Similarity:

Let f: ℝⁿ → ℝ be a polynomial function of degree d with f(0) = 0 and ∇f(0) = 0. Łojasiewicz’s gradient inequality states that there exist C > 0 and ϱ ∈ (0,1) such that | f | C | f | ϱ in a neighbourhood of the origin. We prove that the smallest such exponent ϱ is not greater than 1 - R ( n , d ) - 1 with R ( n , d ) = d ( 3 d - 3 ) n - 1 .

Heights of squares of Littlewood polynomials and infinite series

Artūras Dubickas (2012)

Annales Polonici Mathematici

Similarity:

Let P be a unimodular polynomial of degree d-1. Then the height H(P²) of its square is at least √(d/2) and the product L(P²)H(P²), where L denotes the length of a polynomial, is at least d². We show that for any ε > 0 and any d ≥ d(ε) there exists a polynomial P with ±1 coefficients of degree d-1 such that H(P²) < (2+ε)√(dlogd) and L(P²)H(P²)< (16/3+ε)d²log d. A similar result is obtained for the series with ±1 coefficients. Let A m be the mth coefficient of the square f(x)² of...

On a generalization of the Beiter Conjecture

Bartłomiej Bzdęga (2016)

Acta Arithmetica

Similarity:

We prove that for every ε > 0 and every nonnegative integer w there exist primes p 1 , . . . , p w such that for n = p 1 . . . p w the height of the cyclotomic polynomial Φ n is at least ( 1 - ε ) c w M n , where M n = i = 1 w - 2 p i 2 w - 1 - i - 1 and c w is a constant depending only on w; furthermore l i m w c w 2 - w 0 . 71 . In our construction we can have p i > h ( p 1 . . . p i - 1 ) for all i = 1,...,w and any function h: ℝ₊ → ℝ₊.

Counting triangles that share their vertices with the unit n -cube

Brandts, Jan, Cihangir, Apo

Similarity:

This paper is about 0 / 1 -triangles, which are the simplest nontrivial examples of 0 / 1 -polytopes: convex hulls of a subset of vertices of the unit n -cube I n . We consider the subclasses of right 0 / 1 -triangles, and acute 0 / 1 -triangles, which only have acute angles. They can be explicitly counted and enumerated, also modulo the symmetries of I n .

On nonsingular polynomial maps of ℝ²

Nguyen Van Chau, Carlos Gutierrez (2006)

Annales Polonici Mathematici

Similarity:

We consider nonsingular polynomial maps F = (P,Q): ℝ² → ℝ² under the following regularity condition at infinity ( J ) : There does not exist a sequence ( p k , q k ) ² of complex singular points of F such that the imaginary parts ( ( p k ) , ( q k ) ) tend to (0,0), the real parts ( ( p k ) , ( q k ) ) tend to ∞ and F ( ( p k ) , ( q k ) ) ) a ² . It is shown that F is a global diffeomorphism of ℝ² if it satisfies Condition ( J ) and if, in addition, the restriction of F to every real level set P - 1 ( c ) is proper for values of |c| large enough.

A set on which the Łojasiewicz exponent at infinity is attained

Jacek Chądzyński, Tadeusz Krasiński (1997)

Annales Polonici Mathematici

Similarity:

We show that for a polynomial mapping F = ( f , . . . , f ) : n m the Łojasiewicz exponent ( F ) of F is attained on the set z n : f ( z ) · . . . · f ( z ) = 0 .

A spectral bound for graph irregularity

Felix Goldberg (2015)

Czechoslovak Mathematical Journal

Similarity:

The imbalance of an edge e = { u , v } in a graph is defined as i ( e ) = | d ( u ) - d ( v ) | , where d ( · ) is the vertex degree. The irregularity I ( G ) of G is then defined as the sum of imbalances over all edges of G . This concept was introduced by Albertson who proved that I ( G ) 4 n 3 / 27 (where n = | V ( G ) | ) and obtained stronger bounds for bipartite and triangle-free graphs. Since then a number of additional bounds were given by various authors. In this paper we prove a new upper bound, which improves a bound found by Zhou and Luo in 2008. Our bound involves...

Realizable Galois module classes over the group ring for non abelian extensions

Nigel P. Byott, Bouchaïb Sodaïgui (2013)

Annales de l’institut Fourier

Similarity:

Given an algebraic number field k and a finite group Γ , we write ( O k [ Γ ] ) for the subset of the locally free classgroup Cl ( O k [ Γ ] ) consisting of the classes of rings of integers O N in tame Galois extensions N / k with Gal ( N / k ) Γ . We determine ( O k [ Γ ] ) , and show it is a subgroup of Cl ( O k [ Γ ] ) by means of a description using a Stickelberger ideal and properties of some cyclic codes, when k contains a root of unity of prime order p and Γ = V C , where V is an elementary abelian group of order p r and C is a cyclic group of order m &gt; 1 acting faithfully...

On the adjacent eccentric distance sum of graphs

Halina Bielak, Katarzyna Wolska (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent Eccentric Distance Sum, International Mathematical Forum, Vol. 7 (2002) no. 26, 1289–1294]. The adjacent eccentric distance sum index of the graph G is defined as ξ s v ( G ) = v V ( G ) ε ( v ) D ( v ) d e g ( v ) , where ε ( v ) is the eccentricity of the vertex v , d e g ( v ) is the degree of the vertex v and D ( v ) = u V ( G ) d ( u , v ) is the sum of all distances from...

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G 1 and G 2 be two given graphs. The Ramsey number R ( G 1 , G 2 ) is the least integer r such that for every graph G on r vertices, either G contains a G 1 or G ¯ contains a G 2 . Parsons gave a recursive formula to determine the values of R ( P n , K 1 , m ) , where P n is a path on n vertices and K 1 , m is a star on m + 1 vertices. In this note, we study the Ramsey numbers R ( P n , K 1 F m ) , where F m is a linear forest on m vertices. We determine the exact values of R ( P n , K 1 F m ) for the cases m n and m 2 n , and for the case that F m has no odd component. Moreover, we...