Results 41 to 50 of about 94,460 (146)
Sequences of Primitive and Non-primitive BCH Codes
In this work, we introduce a method by which it is established that; how a sequence of non-primitive BCH codes can be obtained by a given primitive BCH code.
A. S. Ansari +3 more
doaj +1 more source
Quantized flag manifolds and irreducible *-representations
We study irreducible *-representations of a certain quantization of the algebra of polynomial functions on a generalized flag manifold regarded as a real manifold.
Jasper V. Stokman +2 more
core +3 more sources
Epistemic and aleatoric uncertainty quantification in weather and climate models
Aleatoric and epistemic uncertainties over time on weather and climate time‐scales, estimated through ensembles that sample aleatoric and epistemic uncertainty using Bayesian neural networks for parameterisations in the Lorenz 1996 model. The spread shows the 16th and 84th percentiles.
Laura A. Mansfield +1 more
wiley +1 more source
Representation Theory of Groups and D-Modules
In this paper, we study a decomposition D-module structure of the polynomial ring. Then, we illustrate a geometric interpretation of the Specht polynomials. Using Brauer’s characterization, we give a partial generalization of the fact that factors of the
Ibrahim Nonkané
doaj +1 more source
Quantum alpha-determinants and q-deformed hypergeometric polynomials
The quantum $\alpha$-determinant is defined as a parametric deformation of the quantum determinant. We investigate the cyclic $\mathcal{U}_q(\mathfrak{sl}_2)$-submodules of the quantum matrix algebra $\mathcal{A}_q(\mathrm{Mat}_2)$ generated by the ...
Kimoto, Kazufumi
core +2 more sources
Miners' Reward Elasticity and Stability of Competing Proof‐of‐Work Cryptocurrencies
ABSTRACT Proof‐of‐Work cryptocurrencies employ miners to sustain the system through algorithmic reward adjustments. We develop a stochastic model of the multicurrency mining and identify conditions for stable transaction speeds. Bitcoin's algorithm requires hash supply elasticity <$<$1 for stability, while ASERT remains stable for any elasticity and ...
Kohei Kawaguchi +2 more
wiley +1 more source
Irreducible polynomials in Int(ℤ)
In order to fully understand the factorization behavior of the ring Int(ℤ) = {f ∈ ℚ[x] | f (ℤ) ⊆ ℤ} of integer-valued polynomials on ℤ, it is crucial to identify the irreducible elements.
Antoniou Austin +2 more
doaj +1 more source
We obtain the generating functions for the combinatorial enumeration of colorings of all hyperplanes of hypercubes for all irreducible representations of the hyperoctahedral groups.
Krishnan Balasubramanian
doaj +1 more source
Abstract Previous work on legitimacy has conceptualized its multi‐level nature, encompassing individual‐level propriety and collective‐level validity. Recently, scholars have introduced the construct of consensus, the degree to which evaluators agree in terms of their propriety beliefs.
Patrick Haack +2 more
wiley +1 more source
On the total character of finite groups [PDF]
For a finite group $G$, we study the total character $tau_G$ afforded by the direct sum of all the non-isomorphic irreducible complex representations of $G$.
Sunil Kumar Prajapati +1 more
doaj

