Results 91 to 100 of about 55,778 (257)
Ibadan Lectures on Toric Varieties
Toric varieties are perhaps the most accessible class of algebraic varieties. They often arise as varieties parameterized by monomials, and their structure may be completely understood through objects from geometric combinatorics.
Sottile, Frank
core
Fractional moments of L$L$‐functions and sums of two squares in short intervals
Abstract Let b(n)=1$b(n)=1$ if n$n$ is the sum of two perfect squares, and b(n)=0$b(n)=0$ otherwise. We study the variance of B(x)=∑n⩽xb(n)$B(x)=\sum _{n\leqslant x}b(n)$ in short intervals by relating the variance with the second moment of the generating function f(s)=∑n=1∞b(n)n−s$f(s)=\sum _{n=1}^{\infty } b(n)n^{-s}$ along Re(s)=1/2$\mathrm{Re}(s)=1/
Siegfred Baluyot, Steven M. Gonek
wiley +1 more source
The objective of this research is to describe the improvement of the competence of Olympic workshop participants in problem-solving of mathematics Olympiad for mathematics teachers of Junior High Schools in the Madiun Regency by using the qualitative ...
Mohammad Tohir
doaj +1 more source
On Generalized Avicenna Numbers
ABSTRACT Avicenna numbers that we define in this paper, are a class of figurate numbers, including icosahedral, octahedral, tetrahedral, dodecahedral, rhombicosidodecahedral numbers and cubes, play a key role in mathematics, physics and various scientific fields.
Melih Göcen, Yüksel Soykan
wiley +1 more source
Truncated determinants and the refined enumeration of Alternating Sign Matrices and Descending Plane Partitions [PDF]
Lecture notes for the proceedings of the workshop "Algebraic Combinatorics related to Young diagram and statistical physics", Aug.
Di Francesco, Philippe
core
Representations of reductive normal algebraic monoids
The rational representation theory of a reductive normal algebraic monoid (with one-dimensional center) forms a highest weight category, in the sense of Cline, Parshall, and Scott.
D.J. Grigor’ev+7 more
core +1 more source
Strong External Difference Families and Classification of α‐Valuations
ABSTRACT One method of constructing ( a 2 + 1 , 2 , a , 1 )‐SEDFs (i.e., strong external difference families) in Z a 2 + 1 makes use of α‐valuations of complete bipartite graphs K a , a. We explore this approach and we provide a classification theorem which shows that all such α‐valuations can be constructed recursively via a sequence of “blow‐up ...
Donald L. Kreher+2 more
wiley +1 more source
Semidefinite programming, harmonic analysis and coding theory
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics.
Bachoc, Christine
core +6 more sources
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
Further results on permanents of Laplacian matrices of trees
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj +1 more source