منابع مشابه
On Regular Polytope Numbers
Lagrange proved a theorem which states that every nonnegative integer can be written as a sum of four squares. This result can be generalized in two directions. The one is a horizontal generalization which is known as polygonal number theorem, and the other is a higher dimensional generalization which is known as Hilber-Waring problem. In this paper, we shall generalize Lagrange’s sum of four s...
متن کاملConnectivity in the regular polytope representation
In order to be able to draw inferences about real world phenomena from a representation expressed in a digital computer, it is essential that the representation should have a rigorously correct algebraic structure. It is also desirable that the underlying algebra be familiar, and provide a close modelling of those phenomena. The fundamental problem addressed in this paper is that, since compute...
متن کاملAN EXTREMUM PROPERTY CHARACTERIZING THE n-DIMENSIONAL REGULAR CROSS-POLYTOPE
In the spirit of the Genetics of the Regular Figures, by L. Fejes Tóth [FT, Part 2], we prove the following theorem: If 2n points are selected in the n-dimensional Euclidean ball Bn so that the smallest distance between any two of them is as large as possible, then the points are the vertices of an inscribed regular cross-polytope. This generalizes a result of R.A. Rankin [R] for 2n points on t...
متن کاملThe Characteristic Imset Polytope of Bayesian Networks with Ordered Nodes
In 2010, M. Studený, R. Hemmecke, and S. Lindner explored a new algebraic description of graphical models, called characteristic imsets. Compared with standard imsets, characteristic imsets have several advantages: they are still unique vector representatives of conditional independence structures, 0-1 vectors, and more intuitive in terms of graphs than standard imsets. After defining a charact...
متن کاملMagnetism of frustrated regular networks
We consider a regular random network where each node has exactly three neighbours. Ising spins at the network nodes interact antiferromagnetically along the links. The clustering coefficient C is tuned from zero to 1/3 by adding new links. At the same time, the density of geometrically frustrated links increases. We calculate the magnetic specific heat, the spin susceptibility and the Edwards-A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2021
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2021.3056762