Combinatorial polarization

Combinatorial polarization, code loops, and codes of high level

We first find the combinatorial degree of any map f : V → F where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribe...

A Combinatorial Transparent Surface Modeling from Polarization Images

This paper presents a combinatorial (decision tree induction) technique for transparent surface modeling from polarization images. This technique simultaneously uses the object’s symmetry, brewster angle, and degree of polarization to select accurate reference points. The reference points contain information about surface’s normals position and direction at near occluding boundary. We reconstru...

Considering Stochastic and Combinatorial Optimization

Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

Polarization and Polarization Control