Results 31 to 40 of about 726,677 (214)
Quadratic Jordan Algebras and Cubing Operations [PDF]
Transactions of the American Mathematical Society, 1971 In this paper we show how the Jordan structure can be derived from the squaring and cubing operations in a quadratic Jordan algebra, and give an alternate axiomatization of unital quadratic Jordan algebras in terms of operator identities involving only a single variable.
openaire +2 more sources
Algebras of Distributions of Binary Formulas for Theories of Archimedean Solids
Известия Иркутского государственного университета: Серия "Математика", 2019 Algebras of distributions of binary isolating and semi-isolating formulas are derived objects for given theory and reflect binary formula relations between realizations of 1-types.
D.Yu. Emelyanov
doaj +1 more source
Journal of Pure and Applied Algebra, 1981 This is the first of two papers whose main purpose is to prove a generalisation of the Seifert-Van Kampen theorem on the fundamental group of a union of spaces. This generalisation (Theorem C of [8]) will give information in all dimensions and will include as special cases not only the above theorem (without the usual assumptions of path-connectedness)
Brown, Ronald, Higgins, Philip J.
openaire +1 more source
Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs [PDF]
Proceedings of the 31st annual conference on Design automation conference - DAC '94, 1994 Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on zero-suppressed BDDs, a new type of BDDs adapted for cube set manipulation. We propose efficient algorithms for computing unate cube set operations including multiplication and division, followed by some practical ...
S. Minato
semanticscholar +2 more sources
Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019 Recent developments in formal verification of arithmetic datapaths make efficient use of symbolic computer algebra algorithms. The circuit is modeled as an ideal in polynomial rings, and Gröbner basis (GB) reductions are performed over these polynomials ...
Utkarsh Gupta, P. Kalla, V. Rao
semanticscholar +1 more source
Cube-Type Algebraic Attacks on Wireless Encryption Protocols [PDF]
Computer, 2009 Formally evaluating the strengths of a given cryptosystem will ensure that no flaws have crept into the application. During our investigation, we adopted Armknecht and Krause's approach to model the E0 encryption function, which does not depend on memory bits and will hold for every clock tick.
Petrakos, Nikolaos +3 more
openaire +4 more sources
Minimal Rational Interpolation and its Application in Fast Broadband Simulation
IEEE Access, 2019 Broad bandwidth simulation in frequency domain benefits from fast frequency sweep, and frequency-domain electromagnetic solvers are usually combined with asymptotic wave evaluation or interpolation techniques.
Jun Wei Wu, Tie Jun Cui
doaj +1 more source
The Terwilliger algebra of the halved cube
, 2021 Let $D\geq 3$ denote an integer. For any $x\in \mathbb F_2^D$ let $w(x)$ denote the Hamming weight of $x$. Let $X$ denote the subspace of $\mathbb F_2^D$ consisting of all $x\in \mathbb F_2^D$ with even $w(x)$. The $D$-dimensional halved cube $\frac{1}{2}H(D,2)$ is a finite simple connected graph with vertex set $X$ and $x,y\in X$ are adjacent if and ...
Wen, Chia-Yi, Huang, Hau-Wen
openaire +2 more sources
Noncommutative Lattices and Their Continuum Limits [PDF]
, 1995 We consider finite approximations of a topological space $M$ by noncommutative lattices of points. These lattices are structure spaces of noncommutative $C^*$-algebras which in turn approximate the algebra $\cc(M)$ of continuous functions on $M$. We show
Balachandran +20 more
core +2 more sources
Invariance principle on the slice [PDF]
, 2016 We prove an invariance principle for functions on a slice of the Boolean cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our invariance principle shows that a low-degree, low-influence function has similar distributions on the slice,
Filmus, Yuval +3 more
core +3 more sources