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

On the behaviour of the solutions of a k -order cyclic-type system of max difference equations

Gesthimani Stefanidou, Garyfalos Papaschinopoulos (2025)

Czechoslovak Mathematical Journal

Similarity:

We investigate the behaviour of the solutions of a k -dimensional cyclic system of difference equations with maximum. More precisely, we study the existence and the number of the equilibria in the case when k is an odd or an even positive integer, but also for the various values of the exponents of the terms of the difference equations of this system. In addition, we find invariant intervals for our system and we invistegate the convergence of the solutions to the unique positive equilibrium....

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

Ramification in quartic cyclic number fields K generated by x 4 + p x 2 + p

Julio Pérez-Hernández, Mario Pineda-Ruelas (2021)

Mathematica Bohemica

Similarity:

If K is the splitting field of the polynomial f ( x ) = x 4 + p x 2 + p and p is a rational prime of the form 4 + n 2 , we give appropriate generators of K to obtain the explicit factorization of the ideal q 𝒪 K , where q is a positive rational prime. For this, we calculate the index of these generators and integral basis of certain prime ideals.

Resolving sets of directed Cayley graphs for the direct product of cyclic groups

Demelash Ashagrie Mengesha, Tomáš Vetrík (2019)

Czechoslovak Mathematical Journal

Similarity:

A directed Cayley graph C ( Γ , X ) is specified by a group Γ and an identity-free generating set X for this group. Vertices of C ( Γ , X ) are elements of Γ and there is a directed edge from the vertex u to the vertex v in C ( Γ , X ) if and only if there is a generator x X such that u x = v . We study graphs C ( Γ , X ) for the direct product Z m × Z n of two cyclic groups Z m and Z n , and the generating set X = { ( 0 , 1 ) , ( 1 , 0 ) , ( 2 , 0 ) , , ( p , 0 ) } . We present resolving sets which yield upper bounds on the metric dimension of these graphs for p = 2 and 3 .

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