Results 1 to 10 of about 3,513 (95)
Zeros of block-symmetric polynomials on Banach spaces
Математичні Студії, 2020 We investigate sets of zeros of block-symmetric polynomials on the direct sums of sequence spaces. Block-symmetric polynomials are more general objects than classical symmetric polynomials.
V. Kravtsiv
doaj +4 more sources
Continuous block-symmetric polynomials of degree at most two on the space $(L_\infty)^2$
Karpatsʹkì Matematičnì Publìkacìï, 2016 We introduce block-symmetric polynomials on $(L_\infty)^2$ and prove that every continuous block-symmetric polynomial of degree at most two on $(L_\infty)^2$ can be uniquely represented by some "elementary" block-symmetric polynomials.
T.V. Vasylyshyn
doaj +4 more sources
Waring-Girard formulas for block-symmetric and block-supersymmetric polynomials
Математичні СтудіїThis paper investigates the structure and properties of block-symmetric and block-super\-symmetric polynomials in Banach spaces. The study extends classical symmetric polynomial results to infinite-dimensional settings, particularly in sequence spaces ...
V. V. Kravtsiv +2 more
doaj +2 more sources
A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error [PDF]
Calcolo, 2018 The standard way of solving numerically a polynomial eigenvalue problem (PEP) is to use a linearization and solve the corresponding generalized eigenvalue problem (GEP). In addition, if the PEP possesses one of the structures arising very often in applications, then the use of a linearization that preserves such structure combined with a structured ...
Froilan M Dopico, Susana Furtado
exaly +4 more sources
Block-symmetric polynomials correlate with parity better than symmetric [PDF]
computational complexity, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frederic Green +2 more
+11 more sources
Provably Quantum-Secure Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2021 Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting.
Akinori Hosoyamada, Tetsu Iwata
doaj +1 more source
Statement and Solution of Multicriteria Tasks of Database Modular Block-Schemes Development [PDF]
International Journal of Electronics and Telecommunications, 2020 The paper considers developed and offered an effective algorithm for solving the block-symmetrical tasks of polynomial computational complexity of data processing modular block-schemes designing.
Waldemar Wojcik +4 more
doaj +1 more source
A Block-Sparse Tensor Train Format for Sample-Efficient High-Dimensional Polynomial Regression
Frontiers in Applied Mathematics and Statistics, 2021 Low-rank tensors are an established framework for the parametrization of multivariate polynomials. We propose to extend this framework by including the concept of block-sparsity to efficiently parametrize homogeneous, multivariate polynomials with low ...
Michael Götte +2 more
doaj +1 more source
Trends in Computational and Applied Mathematics, 2023 The characterization of inverses of symmetric tridiagonal and block tridiagonal matrices and the development of algorithms for finding the inverse of any general non-singular tridiagonal matrix are subjects that have been studied by many authors.
C. G. Almeida, S. A. E. Remigio
doaj +1 more source
Cogent Engineering, 2022 This paper considers a new method for obtaining an S-box, which is one of the nonlinear transformations used in modern block-symmetric cipher systems.
Ardabek Khompysh +4 more
doaj +1 more source