Results 21 to 30 of about 92,691 (264)
Symmetric Formulas for Products of Permutations
We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,1\}$: given $n$-by-$n$ permutation matrices $M_1,\dots,M_k$, compute the $(1,1)$-entry of the matrix product $M_1\cdots M_k$. An important feature of this function is that it is invariant under action of $S_n^{k-1}$ given by \[ (π_1,\dots,π_{k-1})(M_1 ...
He, William, Rossman, Benjamin
openaire +4 more sources
Infinite symmetric products of rational algebras and spaces
We show that the infinite symmetric product of a connected graded-commutative algebra over $\mathbb{Q}$ is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra.
Hu, Jiahao, Milivojević, Aleksandar
doaj +1 more source
Prepotentials from symmetric products [PDF]
19p, harvmac; One sign in eq.
Lerche, W. +2 more
openaire +2 more sources
The holographic landscape of symmetric product orbifolds
We investigate the growth of coefficients in the elliptic genus of symmetric product orbifolds at large central charge. We find that this landscape decomposes into two regions.
Alexandre Belin +3 more
doaj +1 more source
M-curves and symmetric products [PDF]
Let $(X , σ)$ be a geometrically irreducible smooth projective M-curve of genus $g$ defined over the field of real numbers. We prove that the $n$-th symmetric product of $(X , σ)$ is an M-variety for $n=2 ,3$ and $n\geq 2g -1$.
Biswas, Indranil, D'Mello, Shane
openaire +3 more sources
The Choice of the Appropriate Technology Assumption for Calculating Symmetric Product-by-Product Input-Output Table with Reference to Four Desirable Properties Introduced by Jansen and ten Raa [PDF]
Since the introduction of supply-use input-output model by the United Nations in its 1968 SNA, there has been a controversy on choosing the most appropriate technology assumption for estimating symmetric product by product input-output table.
Parisa Mohajeri +3 more
doaj +1 more source
Two notions X(n) and SP \(X^ n_ G\) of symmetric products of a Hausdorff compact space X are studied. The n-fold symmetric product X(n) is a subspace of the hyperspace \(2^ X\) of subsets of X containing at most n points. For a group G of permutation of a set of n elements, the n-fold G-symmetric product \(SP^ n_ G X\) is the orbit space of the ...
openaire +2 more sources
Diagrams for symmetric product orbifolds [PDF]
43 pages, 19 figures, v2: references ...
Pakman, Ari +2 more
openaire +3 more sources
The stranger things of symmetric product orbifold CFTs
Symmetric product orbifold theories are valuable due to their universal features at large N. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within their moduli space.
Nathan Benjamin +3 more
doaj +1 more source
Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs
Calculating the number of spanning trees in a graph is a crucial problem in combinatorics and physics that has been thoroughly researched for many years by mathematicians and physicists.
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source

