This approach can be efficiently used to solve continuous and, in particular, discrete programmings with arbitrary design variables and constraints. As a search method, this approach requires only computations of the functions and their partial derivatives or differences with respect to design variables...
The Kronecker product of two Schur functions s μ and s v , denoted by s μ * s v , is the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group corresponding to the partitions μ and v. The coefficient of s λ in this product is denoted...
A graph denoted Hn, is called a cycle with parallel chords if Hn is obtained from the cycle Cn : u1, u2,, un (n 6) by adding the chords u2un, u3un1,, u±u, where and if n is odd or if n is even (see Figure 1). In this paper we prove the following results....
Combine Stateflow® and Simulink® capabilities to model hybrid systems. This type of modeling is particularly useful for systems that have numerous possible operational modes based on discrete events. Traditional signal flow is handled in Simulink while changes in control configuration are implemented...
Y. Ollivier and C. Villani. A curved Brunn-Minkowski inequality on the discrete hypercube; Or: What is the Ricci curvature of the discrete hypercube? To appear in SIAM J. Discrete Math., 2012.Y. Ollivier and C. Villani, A curved brunn-minkowski inequality on the discrete hypercube. ...
For an identification of these parameters Chebychev approximation and generalized semi-infinite optimization are applied. In addition, the time-discrete counterparts of the nonlinear equations are introduced and their parametrical stability is investigated by a combinatorial algorithm which detects the region...
The main body consists of ten problems on the Hilbert matrix, showing various aspects of concrete and discrete nature. The majority of these problems are apparently new, but many of their variants and underpinnings have already appeared in the literature. The second half of the article is ...
phase of practice and drill. – Terry Tao Web http://hk.mathphy.google /puremath.htm Blog http://hb / How to Become a Pure Mathematician (or Statistician) Page 3 About this article 4 Stage 1 7 Elementary Stuff 7 Introductory Discrete Mathematics 8 Introductory Algebra 9 Introductory ...
In this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of Γ. We show that if the diameter is at least three, then such a graph, besides a finite ...
J.W.T Young Minimal imbeddings and the genus of a graph J. Math. Mech., 12 (1963), pp. 303-316 CrossrefView in ScopusGoogle Scholar Cited by (12) Genus of total graphs of commutative rings: A survey 2017, Electronic Notes in Discrete Mathematics Show abstract Graphs from Rings 2021,...