Results 231 to 240 of about 2,227,858 (357)
On the fundamental representation of borcherds algebras with one imaginary simple root [PDF]
Reinhold W. Gebert, J�rg Teschner
openalex +1 more source
Enumeration and Construction of Row‐Column Designs
ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger+3 more
wiley +1 more source
Ruijsenaars wavefunctions as modular group matrix coefficients. [PDF]
Di Francesco P+4 more
europepmc +1 more source
Symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ Designs With an Automorphism of Order 2
ABSTRACT The largest prime p $p$ that can be the order of an automorphism of a 2‐( 35 , 17 , 8 ) $(35,17,8)$ design is p = 17 $p=17$, and all 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with automorphisms of an odd prime order p < 17 $p\lt 17 ...
Sanja Rukavina, Vladimir D. Tonchev
wiley +1 more source
Commutative avatars of representations of semisimple Lie groups. [PDF]
Hausel T.
europepmc +1 more source
Interval-set algebra for qualitative knowledge representation
Yiyu Yao
semanticscholar +1 more source
Modelling the drying of single droplets of aqueous solutions of lactose and of maltodextrin
Abstract The average temperature of shrinking droplets is obtained from an enthalpy balance considering convection to or from the surroundings and cooling due to evaporation of solvent from the surface. This unique application of the fully implicit backward scheme captures the moisture values at all nodes in the grid, including at the centre and outer ...
Mohd Rosdan Faridatul Ain+3 more
wiley +1 more source
Decompositions of Hyperbolic Kac-Moody Algebras with Respect to Imaginary Root Groups. [PDF]
Feingold AJ, Kleinschmidt A, Nicolai H.
europepmc +1 more source
On Bipartite Biregular Large Graphs Derived From Difference Sets
ABSTRACT A bipartite graph G = ( V , E ) $G=(V,E)$ with V = V 1 ∪ V 2 $V={V}_{1}\cup {V}_{2}$ is biregular if all the vertices of each stable set, V 1 ${V}_{1}$ and V 2 ${V}_{2}$, have the same degree, r $r$ and s $s$, respectively. This paper studies difference sets derived from both Abelian and non‐Abelian groups.
Gabriela Araujo‐Pardo+3 more
wiley +1 more source