enumeration scheme
Recently Published Documents


TOTAL DOCUMENTS

19
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

2021 ◽  
Vol 31 (09) ◽  
pp. 2150138
Author(s):  
Wei Jin ◽  
Fangyue Chen ◽  
Qinbin He

A directed projection graph of the [Formula: see text]-dimensional hypercube on the two-dimensional plane is successfully created. Any [Formula: see text]-variable Boolean function can be easily transformed to an induced subgraph of the projection. Therefore, the discussions on [Formula: see text]-variable Boolean functions only need to focus on a two-dimensional planar graph. Some mathematical theories on the projection graph and the induced subgraph are established, and some properties and characteristics of a balanced linearly separable Boolean function (BLSBF) are uncovered. In particular, the sub-hypercube decompositions of BLSBF is easily represented on the projection, and meanwhile, the enumeration scheme for counting the number of [Formula: see text]-variable BLSBFs is developed by using equivalence classification and conformal transformation. With the aid of the directed projection grap constructed in this paper, one can further study many difficult problems in some fields such as Boolean functions and artificial neural networks.



2020 ◽  
Vol 13 (4) ◽  
pp. 567-572
Author(s):  
Loris Faina

Abstract This paper presents a unified approach, based on a geometrical method (see Faina in Eur J Oper Res 114:542–556, 1999; Eur J Oper Res 126:340–354, 2000), which reduces the general two and three dimensional cutting and packing type problems to a finite enumeration scheme.



2019 ◽  
Vol 12 (01) ◽  
pp. 2050003
Author(s):  
Aymeric Grodet ◽  
Takuya Tsuchiya

We describe a technique to reorganize topologies of Steiner trees by exchanging neighbors of adjacent Steiner points. We explain how to use the systematic way of building trees, and therefore topologies, to find the correct topology after nodes have been exchanged. Topology reorganizations can be inserted into the enumeration scheme commonly used by exact algorithms for the Euclidean Steiner tree problem in [Formula: see text]-space, providing a method of improvement different than the usual approaches. As an example, we show how topology reorganizations can be used to dynamically change the exploration of the usual branch-and-bound tree when two Steiner points collide during the optimization process. We also turn our attention to the erroneous use of a pre-optimization lower bound in the original algorithm and give an example to confirm its usage is incorrect. In order to provide numerical results on correct solutions, we use planar equilateral points to quickly compute this lower bound, even in dimensions higher than two. Finally, we describe planar twin trees, identical trees yielded by different topologies, whose generalization to higher dimensions could open a new way of building Steiner trees.





10.37236/4002 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
Andrew M. Baxter

We develop algorithmic tools to compute quickly the distribution of permutation statistics over sets of pattern-avoiding permutations. More specfically, the algorithms are based on enumeration schemes, the permutation statistics are based on the number of occurrences of certain vincular patterns, and the permutations avoid sets of vincular patterns. We prove that whenever a finite enumeration scheme exists to count the number of pattern-avoiding permutations, then the distribution of statistics like the number of descents can also be computed based on the same scheme. Statistics such as the number of peaks, right-to-left maxima, and the major index are also investigated, as well as multi-statistics.



Open Physics ◽  
2013 ◽  
Vol 11 (5) ◽  
Author(s):  
Saulius Mickevičius ◽  
Darius Germanas ◽  
Ramutis Kalinauskas

AbstractA new procedure for large-scale calculations of the coefficients of fractional parentage (CFP) for many-particle systems is presented. The approach is based on a simple enumeration scheme for antisymmetric N particle states, and we suggest an efficient method for constructing the eigenvectors of two-particle transposition operator $$P_{N_1 ,N}$$ in a subspace where N 1 and N 2 = N − N 1 nucleons basis states are already antisymmetrized. The main result of this paper is that according to permutation operators $$P_{N_1 ,N}$$ eigenvalues we can distinguish totally asymmetrical N particle states from the other states with lower degree of asymmetry.



2008 ◽  
Vol 35 (6) ◽  
pp. 2114-2128 ◽  
Author(s):  
Horacio Hideki Yanasse ◽  
Daniel Massaru Katsurayama
Keyword(s):  




Sign in / Sign up

Export Citation Format

Share Document