Displaying 21 – 40 of 191

Showing per page

Mathematical aspects of the theory of measures of fuzziness.

Doretta Vivona (1996)

Mathware and Soft Computing

After recalling the axiomatic concept of fuzziness measure, we define some fuzziness measures through Sugeno's and Choquet's integral. In particular, for the so-called homogeneous fuzziness measures we prove two representation theorems by means of the above integrals.

Matrix identities involving multiplication and transposition

Karl Auinger, Igor Dolinka, Michael V. Volkov (2012)

Journal of the European Mathematical Society

We study matrix identities involving multiplication and unary operations such as transposition or Moore–Penrose inversion. We prove that in many cases such identities admit no finite basis.

Matrix of ℤ-module1

Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2015)

Formalized Mathematics

In this article, we formalize a matrix of ℤ-module and its properties. Specially, we formalize a matrix of a linear transformation of ℤ-module, a bilinear form and a matrix of the bilinear form (Gramian matrix). We formally prove that for a finite-rank free ℤ-module V, determinant of its Gramian matrix is constant regardless of selection of its basis. ℤ-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic systems with lattices [22]...

Maximal almost disjoint families of functions

Dilip Raghavan (2009)

Fundamenta Mathematicae

We study maximal almost disjoint (MAD) families of functions in ω ω that satisfy certain strong combinatorial properties. In particular, we study the notions of strongly and very MAD families of functions. We introduce and study a hierarchy of combinatorial properties lying between strong MADness and very MADness. Proving a conjecture of Brendle, we show that if c o v ( ) < , then there no very MAD families. We answer a question of Kastermans by constructing a strongly MAD family from = . Next, we study the...

Maximal free sequences in a Boolean algebra

J. D. Monk (2011)

Commentationes Mathematicae Universitatis Carolinae

We study free sequences and related notions on Boolean algebras. A free sequence on a BA A is a sequence a ξ : ξ < α of elements of A , with α an ordinal, such that for all F , G [ α ] < ω with F < G we have ξ F a ξ · ξ G - a ξ 0 . A free sequence of length α exists iff the Stone space Ult ( A ) has a free sequence of length α in the topological sense. A free sequence is maximal iff it cannot be extended at the end to a longer free sequence. The main notions studied here are the spectrum function 𝔣 sp ( A ) = { | α | : A has an infinite maximal free sequence of length α } and the associated min-max function 𝔣 ( A ) = min ( 𝔣 sp ( A ) ) . Among the results...

Currently displaying 21 – 40 of 191