English
Related papers

Related papers: Phoneme discrimination using $KS$-algebra II

200 papers

The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…

Operator Algebras · Mathematics 2024-08-06 Matija Vidmar

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

Algebraic Geometry · Mathematics 2016-08-31 Bruce Reznick , Neriman Tokcan

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

Rings and Algebras · Mathematics 2018-09-19 Jason Gaddis

We consider the factorisation problem for bialgebras: when a bialgebra $K$ factorises as $K=HL$, where $H$ and $L$ are algebras and coalgebras (but not necessarly bialgebras). Given two maps $R: H\ot L\to L\ot H$ and $W:L\ot H\to H\ot L$,…

Quantum Algebra · Mathematics 2009-09-25 S. Caenepeel , B. Ion , G. Militaru , S. Zhu

For simply-laced quivers, we consider the fixed-point subalgebra of the quiver Hecke algebra under the homogeneous sign map. This leads to a new family of algebras we call alternating quiver Hecke algebras. We give a basis theorem and a…

Representation Theory · Mathematics 2015-04-22 Clinton Boys

This lecture reviews the classification of simple modules of double affine Hecke algebras via the K-theory of Steinberg varieties of affine type

Representation Theory · Mathematics 2009-11-30 Michela Varagnolo , Eric Vasserot

We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…

Formal Languages and Automata Theory · Computer Science 2015-10-27 Magnus Steinby , Eija Jurvanen , Antonio Cano

We prove that the algebra of closed differential forms in an (algebraic, formal, or analytic) disk with logarithmic singularities along several coordinate hyperplanes is (both nontopologically and topologically) Koszul. The connection with…

K-Theory and Homology · Mathematics 2012-12-20 Leonid Positselski

The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…

Category Theory · Mathematics 2013-04-01 Thomas Athorne

We show that each level of the quantifier alternation hierarchy within FO^2[<] -- the 2-variable fragment of the first order logic of order on words -- is a variety of languages. We then use the notion of condensed rankers, a refinement of…

Logic in Computer Science · Computer Science 2015-05-13 Manfred Kufleitner , Pascal Weil

For each integer $k\geq 4$ we describe diagrammatically a positively graded Koszul algebra $\mathbb{D}_k$ such that the category of finite dimensional $\mathbb{D}_k$-modules is equivalent to the category of perverse sheaves on the isotropic…

Representation Theory · Mathematics 2016-08-02 Michael Ehrig , Catharina Stroppel

Based on the Kazama-Suzuki type coset construction and its inverse coset between the subregular $\mathcal{W}$-algebras for $\mathfrak{sl}_n$ and the principal $\mathcal{W}$-superalgebras for $\mathfrak{sl}_{1|n}$, we prove weight-wise…

Representation Theory · Mathematics 2022-06-22 Thomas Creutzig , Naoki Genra , Shigenori Nakatsuka , Ryo Sato

Let K be a field and denote by K[t], the polynomial ring with coefficients in K. Set A = K[f1,. .. , fs], with f1,. .. , fs $\in$ K[t]. We give a procedure to calculate the monoid of degrees of the K algebra M = F1A + $\times$ $\times$…

Algebraic Geometry · Mathematics 2017-03-13 A Abbas , A Assi , Pedro A Garcıa-Sánchez

Language models provide a key framework for studying linguistic theories based on prediction, but phonological analysis using large language models (LLMs) is difficult; there are few phonological benchmarks beyond English and the standard…

Computation and Language · Computer Science 2025-06-13 Zébulon Goriely , Paula Buttery

We begin the study of unitary representations of Hecke algebras of complex reflections groups. We obtain a complete classification for the Hecke algebra of the symmetric group $\mathfrak{S}_n$ over the complex numbers. Interestingly, the…

Representation Theory · Mathematics 2009-10-06 Emanuel Stoica

We explore the question concerning the number of distinct resonant algebras depending on the generator content, which consists of the Lorentz generator, translation, and new additional Lorentz-like and translation-like generators. Such…

High Energy Physics - Theory · Physics 2020-06-23 Remigiusz Durka , Kamil Grela

Let $A$ be a graded C*-algebra. We characterize Kasparov's K-theory group $\hat{K}_0(A)$ in terms of graded *-homomorphisms by proving a general converse to the functional calculus theorem for self-adjoint regular operators on graded…

Operator Algebras · Mathematics 2016-09-07 Jody Trout

We study classes of reproducing kernels $K$ on general domains; these are kernels which arise commonly in machine learning models; models based on certain families of reproducing kernel Hilbert spaces. They are the positive definite kernels…

Functional Analysis · Mathematics 2017-08-22 Palle Jorgensen , Feng Tian

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs

Multiword expressions (MWEs) are a heterogeneous set with a glaring need for classifications. Designing a satisfactory classification involves choosing features. In the case of MWEs, many features are a priori available. Not all features…

Computation and Language · Computer Science 2026-05-13 Eric Laporte