scholarly journals A complete characterization of pretty good state transfer on paths

2019 ◽  
Vol 19 (7&8) ◽  
pp. 601-608
Author(s):  
Christopher M. van Bommel
Keyword(s):  
Sufficient Conditions ◽  
Quantum Walk ◽  
Complete Characterization ◽  
Necessary And Sufficient Conditions ◽  
State Transfer ◽  
Good State ◽  
Necessary And Sufficient ◽  
Positive Integers

We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.

scholarly journals Multigenerator Gabor Frames on Local Fields

2018 ◽  
Vol 33 (2) ◽  
pp. 307
Author(s):  
Owais Ahmad ◽  
Neyaz Ahmad Sheikh
Keyword(s):  
Sufficient Conditions ◽  
Complete Characterization ◽  
Necessary And Sufficient Conditions ◽  
Local Fields ◽  
Gabor Frames ◽  
Gabor System ◽  
Necessary And Sufficient

The main objective of this paper is to provide complete characterization of multigenerator Gabor frames on a periodic set $\Omega$ in $K$. In particular, we provide some necessary and sufficient conditions for the multigenerator Gabor system to be a frame for $L^2(\Omega)$. Furthermore, we establish the complete characterizations of multigenerator Parseval Gabor frames.

scholarly journals On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

2020 ◽  
Vol 15 (1) ◽  
pp. 258-265
Author(s):  
Yu Zhou ◽  
Daoguang Mu ◽  
Xinfeng Dong
Keyword(s):  
Sufficient Conditions ◽  
Sum Of Squares ◽  
Basic Component ◽  
Necessary And Sufficient Conditions ◽  
Autocorrelation Functions ◽  
Walsh Spectrum ◽  
Cryptographic Algorithms ◽  
Necessary And Sufficient ◽  
Relationship Of

AbstractS-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms. In this paper we give the distributions of Walsh spectrum and the distributions of autocorrelation functions for (n + 1)-bit S-boxes in [12]. We obtain the nonlinearity of (n + 1)-bit S-boxes, and one necessary and sufficient conditions of (n + 1)-bit S-boxes satisfying m-order resilient. Meanwhile, we also give one characterization of (n + 1)-bit S-boxes satisfying t-order propagation criterion. Finally, we give one relationship of the sum-of-squares indicators between an n-bit S-box S0 and the (n + 1)-bit S-box S (which is constructed by S0).

Joins of paths and cycles of equal order with sigma chromatic number 2

2021 ◽  
pp. 2250006
Author(s):  
Agnes D. Garciano ◽  
Maria Czarina T. Lagura ◽  
Reginaldo M. Marcelo
Keyword(s):  
Chromatic Number ◽  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Odd Cycle ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Simple Connected Graph

For a simple connected graph [Formula: see text] let [Formula: see text] be a coloring of [Formula: see text] where two adjacent vertices may be assigned the same color. Let [Formula: see text] be the sum of colors of neighbors of any vertex [Formula: see text] The coloring [Formula: see text] is a sigma coloring of [Formula: see text] if for any two adjacent vertices [Formula: see text] [Formula: see text] The least number of colors required in a sigma coloring of [Formula: see text] is the sigma chromatic number of [Formula: see text] and is denoted by [Formula: see text] A sigma coloring of a graph is a neighbor-distinguishing type of coloring and it is known that the sigma chromatic number of a graph is bounded above by its chromatic number. It is also known that for a path [Formula: see text] and a cycle [Formula: see text] where [Formula: see text] [Formula: see text] and [Formula: see text] if [Formula: see text] is even. Let [Formula: see text] the join of the graphs [Formula: see text], where [Formula: see text] or [Formula: see text] [Formula: see text] and [Formula: see text] is not an odd cycle for any [Formula: see text]. It has been shown that if [Formula: see text] for [Formula: see text] and [Formula: see text] then [Formula: see text]. In this study, we give necessary and sufficient conditions under which [Formula: see text] where [Formula: see text] is the join of copies of [Formula: see text] and/or [Formula: see text] for the same value of [Formula: see text]. Let [Formula: see text] and [Formula: see text] be positive integers with [Formula: see text] and [Formula: see text] In this paper, we show that [Formula: see text] if and only if [Formula: see text] or [Formula: see text] is odd, [Formula: see text] is even and [Formula: see text]; and [Formula: see text] if and only if [Formula: see text] is even and [Formula: see text] We also obtain necessary and sufficient conditions on [Formula: see text] and [Formula: see text], so that [Formula: see text] for [Formula: see text] where [Formula: see text] or [Formula: see text] other than the cases [Formula: see text] and [Formula: see text]

scholarly journals Characterizations and Identities for Isosceles Triangular Numbers

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Triangular Numbers ◽  
Triangular Number ◽  
Recursive Formulas ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.

scholarly journals Cheap Talk and Editorial Control

2014 ◽  
Vol 14 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Jonathan Newton
Keyword(s):  
Information Transmission ◽  
Sufficient Conditions ◽  
Cheap Talk ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
Simple Models

AbstractThis paper analyzes simple models of editorial control. Starting from the framework developed by Krishna and Morgan (2001a), we analyze two-sender models of cheap talk where one or more of the senders has the power to veto messages before they reach the receiver. A characterization of the most informative equilibria of such models is given. It is shown that editorial control never aids communication and that for small biases in the senders’ preferences relative to those of the receiver, necessary and sufficient conditions for information transmission to be adversely affected are (i) that the senders have opposed preferences relative to the receiver and (ii) that both senders have powers of editorial control. It is shown that the addition of further senders beyond two weakly decreases information transmission when senders exercising editorial control are anonymous, and weakly increases information transmission when senders exercising editorial control are observed.

Stochastic Orders in Terms of Laplace Transforms

1995 ◽  
Vol 45 (3-4) ◽  
pp. 195-202 ◽  
Author(s):  
Asok K. Nanda
Keyword(s):  
Laplace Transform ◽  
Sufficient Conditions ◽  
Laplace Transforms ◽  
Necessary And Sufficient Conditions ◽  
Stochastic Orders ◽  
Partial Orderings ◽  
Life Distributions ◽  
Necessary And Sufficient

Recently s-FR and s-ST orderings have been defined in the literature. They are more general in the sense that most of the earlier known partial orderings reduce as particular cases of these orderings. Moreover, these orderings have helped in defining new and useful ageing criterion. In this paper, using Laplace transform, we characterize, by means of necessary and sufficient conditions. the property that two life distributions are ordered in the s-FR and s-ST sense. The characterization of LR, FR, MR, VR, STand HAMR orderings follow as particular cases.

scholarly journals A characterization of recurrent motions

1983 ◽  
Vol 28 (1) ◽  
pp. 1-4 ◽  
Author(s):  
Ronald A. Knight
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient ◽  
Stable Flow

Necessary and sufficient conditions for a Poisson stable flow to be recurrent are given.

scholarly journals A characterization of point semiuniformities

1996 ◽  
Vol 19 (2) ◽  
pp. 311-316
Author(s):  
Jennifer P. Montgomery
Keyword(s):  
Topological Group ◽  
Topological Space ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Topological Groups ◽  
Necessary And Sufficient

The concept of a uniformity was developed by A. Well and there have been several generalizations. This paper defines a point semiuniformity and gives necessary and sufficient conditions for a topological space to be point semiuniformizable. In addition, just as uniformities are associated with topological groups, a point semiuniformity is naturally associated with a semicontinuous group. This paper shows that a point semiuniformity associated with a semicontinuous group is a uniformity if and only if the group is a topological group.

On *-clean group rings

2014 ◽  
Vol 14 (01) ◽  
pp. 1550004 ◽  
Author(s):  
Yuanlin Li ◽  
M. M. Parmenter ◽  
Pingzhi Yuan
Keyword(s):  
Local Ring ◽  
Prime Order ◽  
Sufficient Conditions ◽  
Complete Characterization ◽  
Group Rings ◽  
Clean Ring ◽  
Commutative Local Ring ◽  
Irreducible Factorization ◽  
Necessary And Sufficient

A ring with involution * is called *-clean if each of its elements is the sum of a unit and a projection. Clearly a *-clean ring is clean. Vaš asked whether there exists a clean ring with involution * that is not *-clean. In a recent paper, Gao, Chen and the first author investigated when a group ring RG with classical involution * is *-clean and obtained necessary and sufficient conditions for RG to be *-clean, where R is a commutative local ring and G is one of C3, C4, S3 and Q8. As a consequence, the authors provided many examples of group rings which are clean, but not *-clean. In this paper, we continue this investigation and we give a complete characterization of when the group algebra 𝔽Cp is *-clean, where 𝔽 is a field and Cp is the cyclic group of prime order p. Our main result is related closely to the irreducible factorization of a pth cyclotomic polynomial over the field 𝔽. Among other results we also obtain a complete characterization of when RCn (3 ≤ n ≤ 6) is *-clean where R is a commutative local ring.

Sign in / Sign up

Export Citation Format

Share Document