Search results for "Integer"
showing 10 items of 250 documents
Radical Rings with Engel Conditions
2000
Abstract An associative ring R without unity is called radical if it coincides with its Jacobson radical, which means that the set of all elements of R forms a group denoted by R ∘ under the circle operation r ∘ s = r + s + rs on R . It is proved that, for a radical ring R , the group R ∘ satisfies an n -Engel condition for some positive integer n if and only if R is m -Engel as a Lie ring for some positive integer m depending only on n .
Complemented Subspaces and Interpolation Properties in Spaces of Polynomials
1997
LetXbe a Banach space whose dualX* has typep ∈ (1, 2]. Ifmis an integer greater thanp/(p − 1) and (xn) is a seminormalized sequence weakly convergent to zero, there is a subsequence (yn) of (xn) such that, for each element (an) ofl∞, there is anm-homogeneous continuous polynomialPonXwithP(yn) = an,n = 1, 2,… . Some interpolation and complementation properties are also given in P(mlp), form < p, as well as in other spaces of polynomials and multilinear functionals.
Polynomial identities on superalgebras and exponential growth
2003
Abstract Let A be a finitely generated superalgebra over a field F of characteristic 0. To the graded polynomial identities of A one associates a numerical sequence {cnsup(A)}n⩾1 called the sequence of graded codimensions of A. In case A satisfies an ordinary polynomial identity, such sequence is exponentially bounded and we capture its exponential growth by proving that for any such algebra lim n→∞ c n sup (A) n exists and is a non-negative integer; we denote such integer by supexp(A) and we give an effective way for computing it. As an application, we construct eight superalgebras Ai, i=1,…,8, characterizing the identities of any finitely generated superalgebra A with supexp(A)>2 in the f…
Proper identities, Lie identities and exponential codimension growth
2008
Abstract The exponent exp ( A ) of a PI-algebra A in characteristic zero is an integer and measures the exponential rate of growth of the sequence of codimensions of A [A. Giambruno, M. Zaicev, On codimension growth of finitely generated associative algebras, Adv. Math. 140 (1998) 145–155; A. Giambruno, M. Zaicev, Exponential codimension growth of P.I. algebras: An exact estimate, Adv. Math. 142 (1999) 221–243]. In this paper we study the exponential rate of growth of the sequences of proper codimensions and Lie codimensions of an associative PI-algebra. We prove that the corresponding proper exponent exists for all PI-algebras, except for some algebras of exponent two strictly related to t…
Three cyclic branched covers suffice to determine hyperbolic knots.
2005
Let n > m > 2 be two fixed coprime integers. We prove that two Conway reducible, hyperbolic knots sharing the 2-fold, m-fold and n-fold cyclic branched covers are equivalent. Using previous results by Zimmermann we prove that this implies that a hyperbolic knot is determined by any three of its cyclic branched covers.
Quantum computing thanks to Bianchi groups
2018
It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic fie…
Optimal Usage of Multiple Network Connections
2008
In the future mobile networks, a mobile terminal is able to select the best suitable network for each data transmission. The selection of a network connection to be used has been under a lot of study. In this paper, we consider a more extensive case in which we do not select a network connection but use several network connections simultaneously to transfer data. When data is transferred using multiple network connections, a network connection has to be selected for each component of the data. We have modelled this problem as a multiobjective optimization problem and developed a heuristic to solve the problem fast in a static network environment. In this paper, we discuss solving the proble…
Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
2014
Finding differentially regulated subgraphs in a biochemical network is an important problem in bioinformatics. We present a new model for finding such subgraphs which takes the polarity of the edges (activating or inhibiting) into account, leading to the problem of finding a connected subgraph induced by \(k\) vertices with maximum weight. We present several algorithms for this problem, including dynamic programming on tree decompositions and integer linear programming. We compare the strength of our integer linear program to previous formulations of the \(k\)-cardinality tree problem. Finally, we compare the performance of the algorithms and the quality of the results to a previous approac…
Discrete frequency models for inventory management – an introduction
2001
Abstract The paper deals with the problem of devising a periodic replenishment policy when orders must be periodic, but only a given, discrete set of order frequencies can be used. The multi-item, instantaneous replenishment case with known demand is studied. In particular, staggering policies somehow arranging replenishments not to come at the same time instants are considered. The paper is composed of three parts: first, a taxonomy of several versions of the discrete frequency problem is proposed, according to different elements; in the second part, a general mixed integer programming model is proposed which is able to capture the peculiarities of the whole spectrum of this kind of proble…
A branch & bound algorithm for cutting and packing irregularly shaped pieces
2013
Abstract Cutting and packing problems involving irregular shapes, usually known as Nesting Problems, are common in industries ranging from clothing and footwear to furniture and shipbuilding. Research publications on these problems are relatively scarce compared with other cutting and packing problems with rectangular shapes, and are focused mostly on heuristic approaches. In this paper we make a systematic study of the problem and develop an exact Branch & Bound Algorithm. The initial existing mixed integer formulations are reviewed, tested and used as a starting point to develop a new and more efficient formulation. We also study several branching strategies, lower bounds and procedures f…