相关论文: On computations with Double Schubert Automaton and…
We say that the sequence $g_n$, $n\ge 3$, $n \rightarrow \infty$ of polynomial transformation bijective maps of free module $K^n$ over commutative ring $K$ is a sequence of stable degree if the order of $g_n$ is growing with $n$ and the…
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to…
We consider a class of 6D superconformal field theories (SCFTs) which have a large $N$ limit and a semi-classical gravity dual description. Using the quiver-like structure of 6D SCFTs we study a subsector of operators protected from large…
Motivated by Maulik-Okounkov stable maps associated to quiver varieties, we define and construct algebraic stable maps on tensor products of representations in the category O of the Borel subalgebra of an arbitrary untwisted quantum affine…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
We define a version of stable maps into the classifying stack $B\mathrm{GL}_N$, and develop a corresponding notion of $K$-theoretic Gromov-Witten invariants. In this setting, the evaluation morphisms are not of finite type; the definition…
Let $\mathcal{X}$ be a tame proper Deligne-Mumford stack of the form $[M/G]$ where $M$ is a scheme and $G$ is an algebraic group. We prove that the stack $\mathcal{K}_{g,n}(\mathcal{X},d)$ of twisted stable maps is a quotient stack and can…
Let $\hat{\mathfrak{g}}$ be an untwisted affine Kac-Moody algebra, with its Sklyanin-Drinfel'd structure of Lie bialgebra, and let $\hat{\mathfrak{h}}$ be the dual Lie bialgebra. By dualizing the quantum double construction - via formal…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same size. G is a Koenig-Egervary graph if its order equals…
One way to construct a maximal set of mutually unbiased bases (MUBs) in a prime-power dimensional Hilbert space is by means of finite phase-space methods. MUBs obtained in this way are covariant with respect to some subgroup of the group of…
Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
We investigate quantum secret sharing schemes constructed from $[[n,k,\delta]]_D$ non-binary stabilizer quantum error correcting codes with carrier qudits of prime dimension $D$. We provide a systematic way of determining the access…
Schoenberg transformations, mapping Euclidean configurations into Euclidean configurations, define in turn a transformed inertia, whose minimization produces robust location estimates. The procedure only depends upon Euclidean distances…
We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent…
We consider for two based graphs $G$ and $H$ the sequence of graphs $G_k$ given by the wedge sum of $G$ and $k$ copies of $H$. These graphs have an action of the symmetric group $\Sigma_k$ by permuting the $H$-summands. We show that the…
We investigate the statistical stability of a class of dynamical systems semi-conjugate to pre-piecewise \textit{convex or expanding} maps with countably many branches. These systems naturally arise in the study of transformations with…
In this paper we study the preservation of strong stability of strongly continuous semigroups on Hilbert spaces. In particular, we study a situation where the generator of the semigroup has a finite number of spectral points on the…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…
We give a characterization of K-g-fusion frames and discuss the stability of dual g-fusion frames. We also present a necessary and sufficient condition for a quotient operator to be bounded.