A Representation of a Point Symmetric 2-Structure by a Quasi-Domain

In a symmetric 2-structure ${\Sigma =(P,\mathfrak{G}_1,\mathfrak{G}_2,\mathfrak{K})}$ we fix a chain ${E \in \mathfrak{K}}$ and define on E two binary operations “+” and “·”. Then (E,+) is a K-loop and for ${E^* := E {\setminus}\{o\}}$ , (E ^*,·) is a Bol loop. If ${\Sigma}$ is even point symmetric then (E,+ ,·) is a quasidomain and one has the set ${Aff(E,+,\cdot) := \{a^+\circ b^\bullet | a \in E, b \in E^*\}}$ of affine permutations. From Aff(E, +, ·) one can reproduce via a “chain derivation” the point symmetric 2-structure ${\Sigma}$ .     

Symmetric 2-Structures,a Classification

We classify symmetric 2-structures ${(P, \mathfrak{G}_1, \mathfrak{G}_2, \mathfrak{K})}$ , i.e. chain structures which correspond to sharply 2-transitive permutation sets (E, Σ) satisfying the condition: “ ${(*) \, \, \forall \sigma, \tau \in \Sigma : \sigma \circ \tau^{-1} \circ \sigma \in \Sigma}$ ”. To every chain ${K \in \mathfrak{K}}$ one can associate a reflection ${\widetilde{K}}$ in K. Then (*) is equivalent to “ ${(**) \, \, \forall K \in \mathfrak{K} : \widetilde{K}(\mathfrak{K}) = \mathfrak{K}}$ ” and one can define an orthogonality “ ${\perp}$ ” for chains ${K, L \in \mathfrak{K}}$ by “ ${K \perp L \Leftrightarrow K \neq L \wedge \widetilde{K}(L) = L}$ ”. The classification is based on the cardinality of the set of chains which are orthogonal to a chain K and passing through a point p of K. For one of these classes (called point symmetric 2-structures) we proof that in each point there is a reflection and that the set of point reflections forms a regular involutory permutation set.     

Irreducible Jacobian derivations in positive characteristic

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an (n-1)-element p-basis of its ring of constants. In the case of two variables we characterize these derivations in terms of their divergence and some nontrivial constants.     

Large free sets in powers of universal algebras

We prove that for each universal algebra ${(A, \mathcal{A})}$ of cardinality ${|A| \geq 2}$ and infinite set X of cardinality ${|X| \geq | \mathcal{A}|}$ , the X-th power ${(A^{X}, \mathcal{A}^{X})}$ of the algebra ${(A, \mathcal{A})}$ contains a free subset ${\mathcal{F} \subset A^{X}}$ of cardinality ${|\mathcal{F}| = 2^{|X|}}$ . This generalizes the classical Fichtenholtz–Kantorovitch–Hausdorff result on the existence of an independent family ${\mathcal{I} \subset \mathcal{P}(X)}$ of cardinality ${|\mathcal{I}| = |\mathcal{P}(X)|}$ in the Boolean algebra ${\mathcal{P}(X)}$ of subsets of an infinite set X.     

Hlawka’s functional inequality

The paper is devoted to the functional inequality (called by us Hlawka’s functional inequality) $$f(x+y)+f(y+z)+f(x+z)\leq f(x+y+z)+f(x)+f(y)+f(z)$$ for the unknown mapping f defined on an Abelian group, on a linear space or on the real line. The study of the foregoing inequality is motivated by Hlawka’s inequality: $$\|x+y\|+\|y+z\|+\|x+z\|\leq\|x+y+z\|+\|x\|+\|y\|+\|z\|,$$ which in particular holds true for all x, y, z from a real or complex inner product space.     

The natural operators lifting connections to higher order cotangent bundles

We prove that the problem of finding all Mf _m -natural operators C: Q ? QT ^r * lifting classical linear connections ? on m-manifolds M into classical linear connections C _M (?) on the r-th order cotangent bundle T ^r *M = J ^r (M, ?)₀ of M can be reduced to the well known one of describing all M f _m -natural operators D: Q ? ? ^p T ? ? ^q T* sending classical linear connections ? on m-manifolds M into tensor fields D _M (?) of type (p, q) on M.     

L 1-norm of combinations of products of independent random variables

We show that the L ₁-norm of linear combinations (with scalar or vector coefficients) of products of i.i.d. nonnegative mean one random variables is comparable to the l ₁-norm of the coefficients.     

The Armstrong–Frederick cyclic hardening plasticity model with Cosserat effects

We propose an extension of the cyclic hardening plasticity model formulated by Armstrong and Frederick which includes micropolar effects. Our micropolar extension establishes coercivity of the model which is otherwise not present. We study then existence of solutions to the quasistatic, rate-independent Armstrong–Frederick model with Cosserat effects which is, however, still of non-monotone, non-associated type. In order to do this, we need to relax the pointwise definition of the flow rule into a suitable weak energy-type inequality. It is shown that the limit in the Yosida approximation process satisfies this new solution concept. The limit functions have a better regularity than previously known in the literature, where the original Armstrong–Frederick model has been studied.     

A Note on Wiener–Hopf Factorization for Markov Additive Processes

We prove the Wiener–Hopf factorization for Markov additive processes. We derive also Spitzer–Rogozin theorem for this class of processes which serves for obtaining Kendall’s formula and Fristedt representation of the cumulant matrix of the ladder epoch process. Finally, we also obtain the so-called ballot theorem.     

Strong negation in intuitionistic style sequent systems for residuated lattices

We study the sequent system mentioned in the author's work 18 as CyInFL with ‘intuitionistic’ sequents. We explore the connection between this system and symmetric constructive logic of Zaslavsky 40 and develop an algebraic semantics for both of them. In contrast to the previous work, we prove the strong completeness theorem for CyInFL with ‘intuitionistic’ sequents and all of its basic variants, including variants with contraction. We also show how the defined classes of structures are related to cyclic involutive FL‐algebras and Nelson FL_ew‐algebras. In particular, we prove the definitional equivalence of symmetric constructive FL_ewc‐algebras (algebraic models of symmetric constructive logic) and Nelson FL_ew‐algebras (algebras introduced by Spinks and Veroff 33 , 34 as the termwise equivalent definition of Nelson algebras). Because of the strong completeness theorem that covers all basic variants of CyInFL with ‘intuitionistic’ sequents, we rename this sequent system to symmetric constructive full Lambek calculus (). We verify the decidability of this system and its basic variants, as we did in the case of their distributive cousins 18 . As a consequence we obtain that the corresponding theories of (distributive and nondistributive) symmetric constructive FL‐algebras are decidable.