Search results for " combinatorics"
showing 10 items of 296 documents
On the ∗-cocharacter sequence of 3×3 matrices
2000
Abstract Let M 3 (F) be the algebra of 3×3 matrices with involution * over a field F of characteristic zero. We study the ∗ -polynomial identities of M 3 (F) , where ∗=t is the transpose involution, through the representation theory of the hyperoctahedral group B n . After decomposing the space of multilinear ∗ -polynomial identities of degree n under the B n -action, we determine which irreducible B n -modules appear with non-zero multiplicity. In symbols, we write the nth ∗ -cocharacter χ n (M 3 (F),*)=∑ r=0 n ∑ λ⊢r,h(λ)⩽6 μ⊢n−r,h(μ)⩽3 m λ,μ χ λ,μ , where λ and μ are partitions of r and n−r , respectively, χ λ,μ is the irreducible B n -character associated to the pair (λ,μ) and m λ,μ ⩾0 i…
Fixed points and completeness on partial metric spaces
2015
Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a selfmapping on a partial metric space that characterizes the partial metric 0-completeness. In this paper we prove a fixed point result for a new class of…
Ordinary and graded cocharacter of the Jordan algebra of 2x2 upper triangular matrices
2014
Abstract Let F be a field of characteristic zero and U J 2 ( F ) be the Jordan algebra of 2 × 2 upper triangular matrices over F . In this paper we give a complete description of the space of multilinear graded and ordinary identities in the language of Young diagrams through the representation theory of a Young subgroup of S n . For every Z 2 -grading of U J 2 ( F ) we compute the multiplicities in the graded cocharacter sequence and furthermore we compute the ordinary cocharacter.
On computing the degree of convexity of polyominoes
2015
In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as the smallest integer $k$ such that any two cells of $P$ can be joined by a monotone path inside $P$ with at most $k$ changes of direction. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition of $P$ into simpler polyominoes.
Highly irregular graphs with extreme numbers of edges
1997
Abstract A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.
Nilpotent Lie algebras with 2-dimensional commutator ideals
2011
Abstract We classify all (finitely dimensional) nilpotent Lie k -algebras h with 2-dimensional commutator ideals h ′ , extending a known result to the case where h ′ is non-central and k is an arbitrary field. It turns out that, while the structure of h depends on the field k if h ′ is central, it is independent of k if h ′ is non-central and is uniquely determined by the dimension of h . In the case where k is algebraically or real closed, we also list all nilpotent Lie k -algebras h with 2-dimensional central commutator ideals h ′ and dim k h ⩽ 11 .
Polynomial identities for the Jordan algebra of a degenerate symmetric bilinear form
2013
Let J(n) be the Jordan algebra of a degenerate symmetric bilinear form. In the first section we classify all possible G-gradings on J(n) where G is any group, while in the second part we restrict our attention to a degenerate symmetric bilinear form of rank n - 1, where n is the dimension of the vector space V defining J(n). We prove that in this case the algebra J(n) is PI-equivalent to the Jordan algebra of a nondegenerate bilinear form.
Set-valued mappings in partially ordered fuzzy metric spaces
2014
Abstract In this paper, we provide coincidence point and fixed point theorems satisfying an implicit relation, which extends and generalizes the result of Gregori and Sapena, for set-valued mappings in complete partially ordered fuzzy metric spaces. Also we prove a fixed point theorem for set-valued mappings on complete partially ordered fuzzy metric spaces which generalizes results of Mihet and Tirado. MSC:54E40, 54E35, 54H25.
Periodic and quasi-periodic orbits of the dissipative standard map
2011
We present analytical and numerical investigations of the dynamics of the dissipative standard map. We first study the existence of periodic orbits by using a constructive version of the implicit function theorem; then, we introduce a parametric representation, which provides the interval of the drift parameter ensuring the existence of a periodic orbit with a given period. The determination of quasi--periodic attractors is efficiently obtained using the parametric representation combined with a Newton's procedure, aimed to reduce the error of the approximate solution provided by the parametric representation. These methods allow us to relate the drift parameter of the periodic orbits to th…
Speed control design for a vehicle system using fuzzy logic and PID controller
2015
This paper consists of designing fuzzy and PID controllers for controlling the vehicle speed. The dynamic of the system is modeled to provide a transfer function for the plant. Fuzzy and PID controller are designed for linear model. The external disturbances such road grade is considered to stabilizing the system. Both controllers are modeled using MATLAB Simulink software. Finally, a comparative assessment of each simulated result is done based on the response characteristics.