Results 71 to 80 of about 1,659,955 (202)

Sextonians and the magic square [PDF]

open access: yes, 2006
Associated to any complex simple Lie algebra is a non-reductive complex Lie algebra which we call the intermediate Lie algebra. We propose that these algebras can be included in both the magic square and the magic triangle to give an additional row and ...
BRUCE W. WESTBURY, Westbury, Bruce
core   +1 more source

Super Edge Magic Total Labeling on Unicyclic Graphs

open access: yesMakara Seri Sains, 2008
Let G = (V,E) be a simple, connected and undirected graph with v vertices and e edges. An edge magic total labeling is a bijection f from VÈE to a set of integers {1,2,...,v+e} such that if xy is an edge of G then the weight of edge f(x)+f(y)+f(xy) = k ...
Bong Novi Herawati   +3 more
doaj  

VHE gamma ray Astronomy with the MAGIC Telescope

open access: yes, 2006
MAGIC is the largest of the new generation of Imaging Air Cherenkov Telescopes and has started regular data-taking end of 2004. In this report I will give an overview about the status of the experiment and ongoing upgrades, as well as the already rich ...
A. BILAND   +2 more
core  

Range of magic constant on Hexagonal Tortoise Problem

open access: yes, 2015
Hexagonal tortoise problem (HTP), also known as Jisuguimundo or Jisugwimundo, is a magic square variety which was invented by medieval Korean Mathematician and minister Suk-Jung Choi (1646-1715).[1] Choi showed pattern 30 vertices 3 by 3 diagonal shape which has 93 as its magic constant.
openaire   +2 more sources

A MATHEMATICAL MODELING OF CAMPUS INFORMATION SYSTEM [PDF]

open access: yesRomanian Journal of Mathematics and Computer Science, 2016
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, \sum\limits_{v∈V (H)}{f(v)}+\sum\limits_{e∈E(H)}{ f(e)} is constant.
S. STALIN KUMAR, G. MARIMUTHU
doaj  

On total labelings of graphs with prescribed weights

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
Let G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic total labeling of G is a bijection f from V(G)∪E(G) onto the set of consecutive integers {1,2,…,|V(G)|+|E(G)|}, such that all the edge weights or vertex weights ...
Muhammad Irfan   +1 more
doaj   +1 more source

Block Magic

open access: yes, 2011
Studies show that IT can make a useful contribution to learning in infant and primary schools. However, many techniques require major investments in equipment, skills and time.
MIGLINO, ORAZIO
core  

ANALYTICAL FORLVIULAE Ai'll) ALGORITHMS FOR CONSTRUCTING MAGIC SQUARES FROM AN ARBITRARY SET OF 16 NUMBERS [PDF]

open access: yes, 2005
In this paper we seek for an answer on Smarandache type question: may one create the theory of Magic squares 4x4 in size without using properties of some concrete numerical sequences?
CHEBRAKOV, Y.V.
core   +1 more source

Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes

open access: yesPhysical Review X
The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation but imposes substantial space-time overhead. Magic-state factories based on high-rate and -distance quantum low-density parity-check
Varun Menon   +5 more
doaj   +1 more source

Constant depth magic state cultivation with Clifford measurements by gauging

open access: yes
Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measuring the transversal Clifford operator of the color code. Cultivation achieves $\sim 10^{-9}$ logical error rates for the $d=5$ color code, with substantially lower space-time
Hetényi, Bence   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy