Search

The concept of special functions plays an important role in mathematical analysis and physics as well. In this paper, we study some different types of the special Gamma function defined on the two-fold fuzzy complex field, where we combine the classical Gamma function with the two-fold fuzzy algebra defined on complex numbers. On the other hand, many elementary properties of this new special function will be determined in terms of theorems and proofs. [ABSTRACT FROM AUTHOR]

In the present paper, necessary and sufficient conditions are given for the equality of the power rezidue symbols $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ and $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ in the cyclotomic field ℚ(ζ n), 2 ∤ n, for a ∈ ℤ, ( a, n) = 1. This result is a generalization of the classical Eisenstein reciprocity law and its continuation in a Hasse’s paper. Bibliography: 3 titles. [ABSTRACT FROM AUTHOR]

Abstract: The paper gives proofs of some results just claimed in [R. Massy, Galois averages, J. Number Theory 113 (2005) 244–275]. For instance, it is proved that for a finite non-trivial separable extension , , of Hilbertian fields finitely generated over their prime field, the quotient group , for the corresponding multiplicative groups of non-zero elements, cannot be a torsion group of finite exponent. [Copyright &y& Elsevier]

Abstract: We study a family of orthogonal polynomials which generalizes a sequence of polynomials considered by L. Carlitz. We show that they are a special case of the Sheffer polynomials and point out some interesting connections with certain Sobolev orthogonal polynomials. [Copyright &y& Elsevier]

In this paper, we study the Onsager-Machlup function and its relationship to the Freidlin-Wentzell function for measures equivalent to arbitrary infinite dimensional Gaussian measures. The Onsager-Machlup function can serve as a density on infinite dimensional spaces, where a uniform measure does not exist, and has been seen as the Lagrangian for the "most likely element". The Freidlin-Wentzell rate function is the large deviations rate function for small-noise limits and has also been identified as a Lagrangian for the "most likely element". This leads to a conundrum - what is the relationship between these two functions? We show both pointwise and G-convergence (which is essentially the convergence of minimizers) of the Onsager-Machlup function under the small-noise limit to the Freidlin-Wentzell function - and give an expression for both. That is, we show that the small-noise limit of the most likely element is the most likely element in the small noise limit for infinite dimensional measures that are equivalent to a Gaussian. Examples of measures include the law of solutions to path-dependent stochastic differential equations and the law of an infinite system of random algebraic equations. [ABSTRACT FROM AUTHOR]

This paper enriches a pre-existing decision algorithm, which in turn augmented a fragment of Tarski's elementary algebra with one-argument real functions endowed with a continuous first derivative. In its present (still quantifier-free) version, our decidable language embodies the addition of functions and multiplication of functions by scalars; the issue we address is the one of satisfiability. As regards real numbers, individual variables and constructs designating the basic arithmetic operations are available, along with comparison relators. As regards functions, we have variables of another sort, out of which compound terms are formed by means of constructs designating addition and differentiation. An array of predicates designates various relationships between functions, as well as function properties, that may hold over intervals of the real line; those are: function comparisons, strict and non-strict monotonicity / convexity / concavity, comparisons between the derivative of a function and a real-valued term. Our decision method consists in preprocessing the given formula into an equi-satisfiable quantifier-free formula of the elementary algebra of real numbers, whose satisfiability can then be checked by means of Tarski's decision method. No direct reference to functions will appear in the target formula, each function variable having been superseded by a collection of stub real variables; hence, in order to prove that the proposed translation is satisfiability-preserving, we must figure out a flexible-enough family of interpolating C 1 functions that can accommodate a model for the source formula whenever the target formula turns out to be satisfiable. With respect to the results announced in earlier papers of the same stream, a significant effort went into designing the family of interpolating functions so that it could meet the new constraints stemming from the presence of function addition (along with differentiation) among the constructs of our fragment of mathematical analysis. • A formal language RDF* concerned with differentiable real functions is proposed. • The class of differentiable functions treated is closed under addition. • The expressive power of RDF* is illustrated through a gallery of examples. • A satisfiability-preserving algorithm reducing RDF* formulas into an existential sentence of Tarskian algebra is presented. • The correctness of the reduction algorithm is reported. [ABSTRACT FROM AUTHOR]

Rough set theory is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are introduced and some properties of them are given. Moreover, it is proved that the lower and the upper approximations define an interior operator and a closure operator, respectively. Also, using D-lower and D-upper approximation, conditions for a nonempty subset to be definable are provided and investigated that under which condition D-lower and D-upper approximation can be filter. [ABSTRACT FROM AUTHOR]

Solving high-dimensional optimal control problems and corresponding Hamilton–Jacobi PDEs are important but challenging problems in control engineering. In this paper, we propose two abstract neural network architectures which are, respectively, used to compute the value function and the optimal control for certain class of high-dimensional optimal control problems. We provide the mathematical analysis for the two abstract architectures. We also show several numerical results computed using the deep neural network implementations of these abstract architectures. A preliminary implementation of our proposed neural network architecture on FPGAs shows promising speedup compared to CPUs. This work paves the way to leverage efficient dedicated hardware designed for neural networks to solve high-dimensional optimal control problems and Hamilton–Jacobi PDEs. [ABSTRACT FROM AUTHOR]

In this paper, we define and study quasi-monoidal comonads on a monoidal category. It generalize the (Hom type) coquasi-bialgebras to a non-braided setting. We investigate their corepresentations and their coquasitriangular structures. We also discuss their gauge equivalence relations. [ABSTRACT FROM AUTHOR]

In this paper, we establish the validity of the so-called Bounded Approximation Property (BAP) for a comprehensive class of translation and modulation invariant Banach spaces (B, ∥ · ∥B) of tempered distributions on the Euclidean space ℝ d . In fact, such spaces have a double module structure, over some Beurling algebra with respect to convolution, and with respect to pointwise multiplication over some Fourier Beurling algebra. Combining this double module structure with functional analytic arguments which describe the approximation of convolution operators by discrete convolutions we are able to verify the BAP, in fact, for most cases even the Metric Approximation Property (MAP) for such Banach space. The family of spaces under consideration is very rich and contains virtually all the classical function spaces relevant for mathematical analysis, as long as the Schwartz space (ℝ d) is dense in (B, ∥ · ∥B). In particular, all the reflexive spaces in this family are included. Moreover, this family of Banach spaces is closed with respect to intersections, sums and various interpolation methods. [ABSTRACT FROM AUTHOR]

Abstract: In 1.9 of the paper [A. Hahn, A Hermitian Morita theorem for algebras with anti-structure, J. Algebra 93 (1985) 215–235], should be replaced by . This leads to minor changes in the rest of the paper where the ring should be replaced by its opposite and vice versa. [Copyright &y& Elsevier]

In this paper, we present the initiative of type 3 multi fuzzy sets which is an extension of type3 fuzzy sets. we have attempted to propose an extension of type2 multi fuzzy sets into a type3 multi fuzzy sets. In the wake of characterizing type 3 multi fuzzy sets, we examine the algebraic properties of these sets including set-theoretic operation such as complement, inclusion, union, intersection with example. Also we illustrate some algebraic properties. [ABSTRACT FROM AUTHOR]

The -slice algebra is introduced as a generalization of path algebra in higher dimensional representation theory. In this paper, we give a classification of -slice algebras via their -preprojective algebras and the trivial extensions of their quadratic duals. One can always relate tame -slice algebras to the McKay quiver of a finite subgroup of . In the case of , we describe the relations for the -slice algebras related to the McKay quiver of finite Abelian subgroups of and of the finite subgroups obtained from embedding into . [ABSTRACT FROM AUTHOR]

Linear complementary pairs (LCPs) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\sigma $ complementary dual ($\sigma $ -LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. Like Euclidean LCD codes, $\sigma $ -LCD codes can also be used to construct LCP of codes. We show that for $q > 2$ , all $q$ -ary linear codes are $\sigma $ -LCD, and for every binary linear code $\mathcal C$ , the code $\{0\}\times \mathcal C$ is $\sigma $ -LCD. Furthermore, we study deeply $\sigma $ -LCD generalized quasi-cyclic (GQC) codes. In particular, we provide the characterizations of $\sigma $ -LCD GQC codes, self-orthogonal GQC codes, and self-dual GQC codes, respectively. Moreover, we provide the constructions of asymptotically good $\sigma $ -LCD GQC codes. Finally, we focus on $\sigma $ -LCD abelian codes and prove that all abelian codes in a semi-simple group algebra are $\sigma $ -LCD. The results derived in this paper extend those on the classical LCD codes and show that $\sigma $ -LCD codes allow the construction of LCP of codes more easily and with more flexibility. [ABSTRACT FROM AUTHOR]

Abstract Spatially distributed networks of large size arise in a variety of science and engineering problems, such as wireless sensor networks and smart power grids. Most of their features can be described by properties of their state-space matrices whose entries have indices in the vertex set of a graph. In this paper, we introduce novel algebras of Beurling type that contain matrices on a connected simple graph having polynomial off-diagonal decay, and we show that they are Banach subalgebras of B (ℓ p) , 1 ≤ p ≤ ∞ , the space of all bounded operators on the space ℓ p of all p -summable sequences. The ℓ p -stability of state-space matrices is an essential hypothesis for the robustness of spatially distributed networks. In this paper, we establish the equivalence among ℓ p -stabilities of matrices in Beurling algebras for different exponents 1 ≤ p ≤ ∞ , with quantitative analysis for the lower stability bounds. Admission of norm-control inversion plays a crucial role in some engineering practice. In this paper, we prove that matrices in Beurling subalgebras of B (ℓ 2) have norm-controlled inversion and we find a norm-controlled polynomial with close to optimal degree. Polynomial estimate to powers of matrices is important for numerical implementation of spatially distributed networks. In this paper, we apply our results on norm-controlled inversion to obtain a polynomial estimate to powers of matrices in Beurling algebras. The polynomial estimate is a noncommutative extension about convolution powers of a complex function and is applicable to estimate the probability of hopping from one agent to another agent in a stationary Markov chain on a spatially distributed network. [ABSTRACT FROM AUTHOR]

This paper continues formalization in the Mizar system [2, 1] of basic notions of the composition-nominative approach to program semantics [14] which was started in [8, 12, 10]. The composition-nominative approach studies mathematical models of computer programs and data on various levels of abstraction and generality and provides tools for reasoning about their properties. In particular, data in computer systems are modeled as nominative data [15]. Besides formalization of semantics of programs, certain elements of the composition-nominative approach were applied to abstract systems in a mathematical systems theory [4, 6, 7, 5, 3]. In the paper we give a formal definition of the notions of a binominative function over given sets of names and values (i.e. a partial function which maps simple-named complex-valued nominative data to such data) and a nominative predicate (a partial predicate on simple-named complex-valued nominative data). The sets of such binominative functions and nominative predicates form the carrier of the generalized Glushkov algorithmic algebra for simple-named complex-valued nominative data [15]. This algebra can be used to formalize algorithms which operate on various data structures (such as multidimensional arrays, lists, etc.) and reason about their properties. In particular, we formalize the operations of this algebra which require a specification of a data domain and which include the existential quantifier, the assignment composition, the composition of superposition into a predicate, the composition of superposition into a binominative function, the name checking predicate. The details on formalization of nominative data and the operations of the algorithmic algebra over them are described in [11, 13, 9]. [ABSTRACT FROM AUTHOR]

This paper continues formalization in Mizar [2, 1] of basic notions of the composition-nominative approach to program semantics [13] which was started in [8, 11]. The composition-nominative approach studies mathematical models of computer programs and data on various levels of abstraction and generality and provides tools for reasoning about their properties. Besides formalization of semantics of programs, certain elements of the composition-nominative approach were applied to abstract systems in a mathematical systems theory [4, 6, 7, 5, 3]. In the paper we introduce a definition of the notion of a binominative function over a set D understood as a partial function which maps elements of D to D. The sets of binominative functions and nominative predicates [11] over given sets form the carrier of the generalized Glushkov algorithmic algebra [14]. This algebra can be used to formalize algorithms which operate on various data structures (such as multidimensional arrays, lists, etc.) and reason about their properties. We formalize the operations of this algebra (also called compositions) which are valid over uninterpretated data and which include among others the sequential composition, the prediction composition, the branching composition, the monotone Floyd-Hoare composition, and the cycle composition. The details on formalization of nominative data and the operations of the algorithmic algebra over them are described in [10, 12, 9]. [ABSTRACT FROM AUTHOR]

Text Let k , l , a , b , c be positive integers such that gcd ⁡ ( k a , l b ) = 1 , min ⁡ { a , b , c } > 1 , a ≠ 3 , b ≠ 3 and 2 ∤ c . In this paper, we prove that there are at most four solutions in positive integers ( x , y , z ) to the equation k a x + l b y = c z and at most two solutions when 2 ∤ ( u ( l / k ) ) , where u ( m ) is the least positive integer t with m t ≡ 1 ( mod c ) . Video For a video summary of this paper, please visit https://youtu.be/Dt3Y7TDMxlg . [ABSTRACT FROM AUTHOR]

This paper examines the Euler–Rodrigues formula in dual 3-space D 3 by analyzing its variations such as vectorial form, exponential map, point–line theory and quaternions which have some intrinsic relations. Contrary to the Euclidean case, dual rotation in dual 3-space corresponds to a screw motion in Euclidean 3-space. This paper begins by explaining dual motion in terms of the given dual axis and angle. It will then go on to express dual Euler–Rodrigues formula with algebraic methods. Furthermore, an application of dual Euler–Rodrigues formula to point–line geometry is accomplished and point–line displacement operator is obtained by dual Euler–Rodrigues formula. Finally, dual Euler–Rodrigues formula is presented with the help of dual Euler–Rodrigues parameters that is expressed as a dual quaternion. [ABSTRACT FROM AUTHOR]

In this paper, we study an excision theorem of the dihedral and reflexive (co)homology theory of associative algebras. That is, for such an extension, we obtain a six-term exact sequence in the dihedral cohomology. Also, we present and prove the relation between cyclic and dihedral cohomology of algebras and some examples. [ABSTRACT FROM AUTHOR]

Hyperstructure theory has many applications to several areas of pure and applied sciences. This paper investigates some properties of hyper B -algebras which is a generalization of B -algebras. This paper also introduces the notion of hyper B -ideals, weak hyper B -ideals and strong hyper B -ideals in hyper B - algebras and gives some relations among these hyper B -ideals. Relations between hyper B -ideals and subhyper B -algebras of H is also discussed. Moreover, homomorphism on hyper B -algebra is defined and some related properties are given. Finally, proof of the relationship between the hyper B -algebras and hypergroups is provided. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of the theory of permutation groups. However, this is another instance of a situation common in mathematics in which a very natural problem turns out to be extremely difficult. Fortunately, the enormous progresses of the last few decades seem to allow a new momentum on the attack to this problem. In this paper we prove that there are infinite families of primitive groups contained in the union of imprimitive groups and propose a new hierarchy for primitive groups based on that fact. In addition we introduce some algorithms to handle permutations, provide the corresponding GAP implementation, solve some open problems, and propose a large list of open problems. [ABSTRACT FROM AUTHOR]

In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on classical propositional logic. In this paper, we present a version of ACPps built on a paraconsistent propositional logic which is essentially the same as CLuNs. There are many systems that would have to deal with selfcontradictory states if no special measures were taken. For a number of these systems, it is conceivable that accepting self-contradictory states and dealing with them in a way based on a paraconsistent logic is an alternative to taking special measures. The presented version of ACPps can be suited for the description and analysis of systems that deal with self-contradictory states in a way based on the above-mentioned paraconsistent logic. [ABSTRACT FROM AUTHOR]

In this paper, we would like to use umbral calculus in order to derive some properties, recurrence relations and identities related to r-Stirling numbers of second kind and r-Bell polynomials. In particular, we will express the r-Bell polynomials as linear combinations of many well-known families of special polynomials. [ABSTRACT FROM AUTHOR]

In this paper, we would like to exploit umbral calculus in order to derive explicit expressions, some properties, recurrence relations and identities for poly-Genocchi polynomials. [ABSTRACT FROM AUTHOR]

The Changhee polynomials and numbers are introduced in [3], and some interesting identities and properties of these polynomials are found by many researcher. In this paper, we consider the q-analogue of modified degen-erated Changhee polynomials and derive some new and interesting identities and properties of those polynomials. [ABSTRACT FROM AUTHOR]

Recently, Mihoubi and Taharbouchet gave some interesting method of obtain-ing certain identities for Appell polynomials of arbitrary orders starting from the given identities for Appell polynomials of fixed orders. In addition, they illustrated their method with several examples. The purpose of this paper is to note that their method can be gen-eralized so as to include any Sheffer polynomials. Also, we will provide many examples that illustrate our results. [ABSTRACT FROM AUTHOR]

This paper presents a simple way for diagonalization of matrices in an arbitrary field, with which one can calculate functions of matrices. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we describe the K -module H H 1 (L K (Γ)) of outer derivations of the Leavitt path algebra L K (Γ) of a row-finite graph Γ with coefficients in an associative commutative ring K with unit. We explicitly describe a set of generators of H H 1 (L K (Γ)) and relations among them. We also describe a Lie algebra structure of outer derivation algebra of the Toeplitz algebra. We prove that every derivation of a Leavitt path algebra can be extended to a derivation of the corresponding C ⁎ -algebra. [ABSTRACT FROM AUTHOR]

Abstract Olivieri, del Río and Simón defined strongly monomial groups and a significant result proved by them is the explicit description of the simple components of the rational group algebra Q G of a strongly monomial group G. In this paper, generalized strongly monomial groups are defined, which is a generalization of strongly monomial groups. Beside strongly monomial groups, an extensive list of important families of groups which are generalized strongly monomial is produced. A description of the simple components of Q G , when G is a generalized strongly monomial group, is also provided. Furthermore, the work by Jespers, Olteanu, del Río and Van Gelder on the construction of a subgroup of finite index in the group of central units of integral group ring of a strongly monomial group has also been generalized. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we study the representation theory of the Fuss–Catalan algebras, FC n (a , b). We prove that this algebra is cellular with a cellular basis and forms a tower of recollement, as defined by Cox, Martin, Parker, and Xi [7] , and hence, it is quasi-hereditary algebra if a , b are non-zero complex numbers. [ABSTRACT FROM AUTHOR]

In this paper, we obtain the formula for the Kac determinant of the algebra arising from the level N representation of the Ding-Iohara-Miki algebra. It is also discovered that its singular vectors correspond to generalized Macdonald functions (the q-deformed version of the AFLT basis). [ABSTRACT FROM AUTHOR]

Given a triangle functor F: A→B, the authors introduce the half image hImF, which is an additive category closely related to F. If F is full or faithful, then hImF admits a natural triangulated structure. However, in general, one can not expect that hImF has a natural triangulated structure. The aim of this paper is to prove that hImF admits a natural triangulated structure if and only if F satisfies the condition (SM). If this is the case, hImF is triangle-equivalent to the Verdier quotient A/KerF. [ABSTRACT FROM AUTHOR]

The power UP-algebras of types 1 and 2 were proved by Iampan [1]. In this paper, we prove the generalized power UP-algebras of types 1 and 2, and find its cardinality. [ABSTRACT FROM AUTHOR]

Abstract We study ground states of two-component Bose–Einstein condensates (BEC) with trapping potentials in R 2 , where the intraspecies interaction (− a 1 , − a 2) and the interspecies interaction − β are both attractive, i. e , a 1 , a 2 and β are all positive. The existence and non-existence of ground states are classified completely by investigating equivalently the associated L 2 -critical constraint variational problem. The uniqueness and symmetry-breaking of ground states are also analyzed under different types of trapping potentials as β ↗ β ⁎ = a ⁎ + (a ⁎ − a 1) (a ⁎ − a 2) , where 0 < a i < a ⁎ : = ‖ w ‖ 2 2 (i = 1 , 2) is fixed and w is the unique positive solution of Δ w − w + w 3 = 0 in R 2. The semi-trivial limit behavior of ground states is tackled in the companion paper [12]. [ABSTRACT FROM AUTHOR]

In this paper, we study varieties and characterize convolution operators on the algebras related to the new structures of KPC-hypergroups, which are a generalization of the classical ones. [ABSTRACT FROM AUTHOR]

Let μ be a Borel measure on a compactum X. The main objects in this paper are s-ideals Ipdimq, J0pμq, Jf pμq of Borel sets in X that can be covered by countably many compacta which are finite-dimensional, or of μ-measure null, or of finite μ-measure, respectively. Answering a question of J. Zapletal, we shall show that for the Hilbert cube, the s-ideal Ipdimq is not homogeneous in a strong way. We shall also show that in some natural instances of measures μ with nonhomogeneous s-ideals J0pμq or Jf pμq, the completions of the quotient Boolean algebras BorelpXq{J0pμq or BorelpXq{Jf pμq may be homogeneous. We discuss the topic in a more general setting, involving calibrated s-ideals. [ABSTRACT FROM AUTHOR]

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose that a non-negative monotone submodular function f:Z+n→R+ is given via an evaluation oracle. Assume further that f satisfies the diminishing return property, which is not an immediate consequence of submodularity when the domain is the integer lattice. Given this, we design polynomial-time (1-1/e-ϵ)-approximation algorithms for a cardinality constraint, a polymatroid constraint, and a knapsack constraint. For a cardinality constraint, we also provide a (1-1/e-ϵ)-approximation algorithm with slightly worse time complexity that does not rely on the diminishing return property. [ABSTRACT FROM AUTHOR]

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro. [ABSTRACT FROM AUTHOR]

Let R be a commutative ring with an identity different from zero and n be a positive integer. Anderson and Badawi, in their paper on n-absorbing ideals, define a proper ideal I of a commutative ring R to be an n-absorbing ideal of R, if whenever x1 . . . xn+1 ∊ I for x1 , . . . , xn+1 ∊ ωR , then there are n of the Xi's whose product is in I and conjecture that ωR[x](I[X]) = ωR(I) for any ideal I of an arbitrary ring R, where ωR(I) = min{n: I is an n-absorbing ideal of R}. In th e present paper, we use content formula techniques to prove th a that their conjecture is true, if one of the following conditions hold: (1) The ring R is a Prüfer domain. (2) The ring R is a Gaussian ring such th a that its additive group is torsion-free. (3) The additive group of the ring R is torsion-free and I is a radical ideal of R. [ABSTRACT FROM AUTHOR]

We prove a version of the Deligne conjecture for n -fold monoidal abelian categories A over a field k of characteristic 0, assuming some compatibility and non-degeneracy conditions for A . The output of our construction is a weak Leinster ( n , 1 ) -algebra over k , a relaxed version of the concept of Leinster n -algebra in A lg ( k ) . The difference between the Leinster original definition and our relaxed one is apparent when n > 1 , for n = 1 both concepts coincide. We believe that there exists a functor from weak Leinster ( n , 1 ) -algebras over k to C • ( E n + 1 , k ) -algebras, well-defined when k = Q , and preserving weak equivalences. For the case n = 1 such a functor is constructed in [31] by elementary simplicial methods, providing (together with this paper) a complete solution for 1-monoidal abelian categories. Our approach to Deligne conjecture is divided into two parts. The first part, completed in the present paper, provides a construction of a weak Leinster ( n , 1 ) -algebra over k , out of an n -fold monoidal k -linear abelian category (provided the compatibility and non-degeneracy condition are fulfilled). The second part (still open for n > 1 ) is a passage from weak Leinster ( n , 1 ) -algebras to C • ( E n + 1 , k ) -algebras. As an application, we prove in Theorem 8.1 that the Gerstenhaber–Schack complex of a Hopf algebra over a field k of characteristic 0 admits a structure of a weak Leinster ( 2 , 1 ) -algebra over k extending the Yoneda structure. It relies on our earlier construction [30] of a 2-fold monoidal structure on the abelian category of tetramodules over a bialgebra. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of achieving monotonic tracking control for any initial condition (also referred to as global monotonic tracking control ). This property is shown to be equivalent to global non-overshooting as well as to global non-undershooting (i.e., non-overshooting and non-undershooting for any initial condition, respectively). The main objective of this paper is to prove that a stable system is globally monotonic if and only if all the rows of the output matrix are left eigenvectors of the space transition matrix. This property allows one to formulate the design of a controller which ensures global monotonic tracking as a convex optimization problem described by a set of Linear Matrix Inequalities (LMIs). [ABSTRACT FROM AUTHOR]

Following the prototype of dimonoids, directional algebras are obtained from universal algebras by splitting each fundamental operation into a number of distinct fundamental operations corresponding to directions or selected arguments in the original fundamental operation. Thus dimonoids are directional semigroups, with left- and right-directed multiplications. Directional quasigroups appear in a number of versions, depending on the axiomatization chosen for quasigroups, but this paper concentrates on 4-diquasigroups, which incorporate a left and right quasigroup structure. While introducing several new instances of 4-diquasigroups, including dicores and group-representable diquasigroups, the paper is primarily devoted to the study of undirected replicas of directional binary algebras, dimonoids, digroups, and diquasigroups, where the two directed multiplications are identified. Undirected replicas of diquasigroups are two-sided quasigroups, and thus offer a new approach to the construction of quasigroups of various kinds. [ABSTRACT FROM AUTHOR]

In this paper we employ a C-algebra approach to the study of Fredholm properties of differential and pseudodifferential operators on the half line. The algebra investigated in this paper has compact commutators, so the Gelfand theory applies to the quotient algebra, and we obtain an explicit description of the corresponding maximal ideal space and necessary and sufficient conditions for Fredholmness of operators in the algebra. [ABSTRACT FROM AUTHOR]

The concept of a relatively weakly injective pair of operator systems is introduced and studied in this paper, motivated by relative weak injectivity in the C*-algebra category. E. Kirchberg [11] proved that the C\*-algebra C\*(F∞) of the free group F∞ on countably many generators characterises relative weak injectivity for pairs of C\*-algebras by means of the maximal tensor product. One of the main results of this paper shows that C\*(F∞) also characterises relative weak injectivity in the operator system category. A key tool is the theory of operator system tensor products [9,10]. [ABSTRACT FROM AUTHOR]