Results 31 to 40 of about 16,356,505 (288)

On the Turán number of some ordered even cycles [PDF]

open access: yesEuropean Journal of Combinatorics, 2018
10 pages, 1 figure; added references and some ...
Ervin Györi   +5 more
openaire   +3 more sources

Affine difference sets of even order

open access: yesJournal of Combinatorial Theory, Series A, 1989
Let G be a direct sum of a group of order \(n+1\) and of an Abelian group N of order n-1. If n is even (different from 2), and G admits an affine difference set relative to N then \(n=4k\) and N admits a \((4k-1,4k-1,k-1)\) difference set. Proofs, variations and corollaries are very interesting; for brevity we quote only that there is no nilpotent ...
Arasu, K.T., Jungnickel, Dieter
openaire   +4 more sources

Asymptotic Properties of Neutral Differential Equations with Variable Coefficients

open access: yesAxioms, 2020
The aim of this work is to study oscillatory behavior of solutions for even-order neutral nonlinear differential equations. By using the Riccati substitution, a new oscillation conditions is obtained which insures that all solutions to the studied ...
Omar Bazighifan   +2 more
doaj   +1 more source

Oscillatory behavior of even-order nonlinear differential equations with a sublinear neutral term [PDF]

open access: yesOpuscula Mathematica, 2019
The authors present a new technique for the linearization of even-order nonlinear differential equations with a sublinear neutral term. They establish some new oscillation criteria via comparison with higher-order linear delay differential inequalities ...
John R. Graef   +2 more
doaj   +1 more source

Conjugacy of Self-Adjoint Difference Equations of Even Order

open access: yesAbstract and Applied Analysis, 2011
We study oscillation properties of 2n-order Sturm-Liouville difference equations. For these equations, we show a conjugacy criterion using the p-criticality (the existence of linear dependent recessive solutions at ∞ and -∞).
Petr Hasil
doaj   +1 more source

Finite groups whose maximal subgroups of even order are MSN-groups

open access: yesOpen Mathematics, 2022
A finite group GG is called an MSN-group if all maximal subgroups of the Sylow subgroups of GG are subnormal in GG. In this article, we investigate the structure of finite groups GG such that GG is a non-MSN-group of even order in which every maximal ...
Wang Wanlin, Guo Pengfei
doaj   +1 more source

A New Approach in the Study of Oscillation Criteria of Even-Order Neutral Differential Equations

open access: yesMathematics, 2020
Based on the comparison with first-order delay equations, we establish a new oscillation criterion for a class of even-order neutral differential equations. Our new criterion improves a number of existing ones. An illustrative example is provided.
Osama Moaaz   +2 more
doaj   +1 more source

Oscillation Criteria of Higher-order Neutral Differential Equations with Several Deviating Arguments

open access: yesMathematics, 2020
This work is concerned with the oscillatory behavior of solutions of even-order neutral differential equations. By using the technique of Riccati transformation and comparison principles with the second-order differential equations, we obtain a new ...
Osama Moaaz   +2 more
doaj   +1 more source

Latin cubes of even order with forbidden entries [PDF]

open access: yesEuropean Journal of Combinatorics, 2020
We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $γ> 0$ such that if $n=2t$ and $A$ is a $3$-dimensional $n\times n\times n$ array where every cell contains at most $γn$ symbols, and every symbol occurs at most $γn$ times in every line of
Casselgren, Carl Johan, Anh Pham, Lan
openaire   +3 more sources

On regular handicap graphs of even order

open access: yesElectronic Notes in Discrete Mathematics, 2017
Abstract Let G = ( V , E ) be a simple graph of order n. A bijection f : V → { 1 , 2 , … , n } is a handicap labeling of G if there exists an integer l such that ∑ u ∈ N ( v ) f ( u ) = l + f ( v ) for all v ∈ V , where N(v) is the set of all vertices adjacent to v.
Dalibor Froncek   +6 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy