English
Related papers

Related papers: The Schur Algorithm in Terms of System Realization

200 papers

The Schur-Weyl states belong to a special class of states with a symmetry described by two Young and Weyl tableaux. Representation of physical systems in Hilbert space spanned on these states enables to extract quantum information hidden in…

Quantum Physics · Physics 2021-03-03 Michał Kaczor , Paweł Jakubczyk

This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…

Logic in Computer Science · Computer Science 2017-09-26 Fritz Müller

We consider Cauchy type integrals $I(t)={1\over 2\pi i}\int_{\gamma} {g(z)dz\over z-t}$ with $g(z)$ an algebraic function. The main goal is to give constructive (at least, in principle) conditions for $I(t)$ to be an algebraic function, a…

Classical Analysis and ODEs · Mathematics 2007-05-23 F. Pakovich , N. Roytvarf , Y. Yomdin

Inspired by the classic apolarity theory of symmetric tensors, the aim of this paper is to introduce the Schur apolarity theory, i.e. an apolarity for any irreducible representation of the special linear group $SL(V)$. This allows to…

Algebraic Geometry · Mathematics 2022-03-15 Reynaldo Staffolani

The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions. The core of the computations relies on…

Logic in Computer Science · Computer Science 2010-04-29 Franck Butelle , Florent Hivert , Micaela Mayero , Frédéric Toumazet

In the noisy tensor completion problem we observe $m$ entries (whose location is chosen uniformly at random) from an unknown $n_1 \times n_2 \times n_3$ tensor $T$. We assume that $T$ is entry-wise close to being rank $r$. Our goal is to…

Machine Learning · Computer Science 2016-02-19 Boaz Barak , Ankur Moitra

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

Combinatorics · Mathematics 2020-05-08 Laura Colmenarejo , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

We develop algorithms for certifying an approximation to a nonsingular solution of a square system of equations built from univariate analytic functions. These algorithms are based on the existence of oracles for evaluating basic data about…

Symbolic Computation · Computer Science 2019-07-22 Michael Burr , Kisun Lee , Anton Leykin

Density functional theory is a successful branch of numerical simulations of quantum systems. While the foundations are rigorously defined, the universal functional must be approximated resulting in a `semi'-ab initio approach. The search…

Quantum Physics · Physics 2017-11-22 James Daniel Whitfield , Norbert Schuch , Frank Verstraete

We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…

Combinatorics · Mathematics 2009-04-02 Sarah Mason

We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic…

Numerical Analysis · Mathematics 2019-06-18 Fernando De Terán , Bruno Iannazzo , Federico Poloni , Leonardo Robol

In this paper, we consider formal series associated with events, profiles derived from events, and statistical models that make predictions about events. We prove theorems about realizations for these formal series using the language and…

Machine Learning · Statistics 2009-01-20 Robert L Grossman , Richard G Larson

Glasser's Master Theorem arXiv:1308.6361v2 is essentially a restatement of Cauchy's integral Theorem reduced to a specialized form. Here we extend that theorem by introducing two new parameters, but still retain a simple form. Because of…

Classical Analysis and ODEs · Mathematics 2024-02-28 Michael Milgram

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

Logic in Computer Science · Computer Science 2015-07-01 Jean-Louis Krivine

This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…

Quantum Physics · Physics 2007-05-23 C. Lavor , L. R. U. Manssur , R. Portugal

In the context of the complex-analytic structure within the unit disk centered at the origin of the complex plane, that was presented in a previous paper, we show that singular Schwartz distributions can be represented within that same…

Complex Variables · Mathematics 2019-02-19 Jorge L. deLyra

This paper shows the complementary roles of mathematical and engineering points of view when dealing with truss analysis problems involving systems of linear equations and inequalities. After the compatibility condition and the mathematical…

Computational Engineering, Finance, and Science · Computer Science 2015-01-28 R. Mínguez , E. Castillo , R. Pruneda , C. Solares

A seminal result of Agler characterizes the so-called Schur-Agler class of functions on the polydisk in terms of a unitary colligation transfer function representation. We generalize this to the unit ball of the algebra of multipliers for a…

Functional Analysis · Mathematics 2007-05-23 Michael A. Dritschel , Stefania Marcantognini , Scott McCullough

Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…

Combinatorics · Mathematics 2023-02-02 Andrii Dmytryshyn