Related papers: Recursive algorithm and branching for nonmaximal e…
We introduce the notion of a spectral character for finite-dimensional representations of affine algebras. These can be viewed as a suitable q=1 limit of the elliptic characters defined by Etingof and Moura for quantum affine algebras. We…
Transformers process tokens in parallel but are temporally shallow: at position $t$, each layer attends to key-value pairs computed based on the previous layer, yielding a depth capped by the number of layers. Recurrent models offer…
Coding theory is a central discipline underpinning wireline and wireless modems that are the workhorses of the information age. Progress in coding theory is largely driven by individual human ingenuity with sporadic breakthroughs over the…
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
We produce a new basis for the Schur and Weyl modules associated to a row-convex shape, D. The basis is indexed by new class of "straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is…
Let L be a finite-dimensional semisimple Lie algebra with a non-degenerate invariant bilinear form, \sigma an elliptic automorphism of L leaving the form invariant, and A a \sigma-invariant reductive subalgebra of L, such that the…
In this paper we address a practical aspect of differential barrier penalty functions in linear programming. In this respect we propose an affine scaling interior point algorithm based on a large classe of differential barrier functions.…
Nonlinearity parameter tomography leads to the problem of identifying a coefficient in a nonlinear wave equation (such as the Westervelt equation) modeling ultrasound propagation. In this paper we transfer this into frequency domain, where…
A new domain decomposition method for Maxwell's equations in conductive media is presented. Using this method reconstruction algorithms are developed for determination of dielectric permittivity function using time-dependent scattered data…
For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations $V(t)$, we decompose the tensor powers of $V(t)$ into irreducible factors in a uniform manner, using a tool we call {\it diagram…
We introduce the notion of standard multipartitions and establish a one-to-one correspondence between standard multipartitions and irreducible representations with integral weights for the affine Hecke algebra of type A with a parameter q…
A framework to boost the efficiency of Bayesian inference in probabilistic programs is introduced by embedding a sampler inside a variational posterior approximation. We call it the refined variational approximation. Its strength lies both…
A general-purpose computational homogenization framework is proposed for the nonlinear dynamic analysis of membranes exhibiting complex microscale and/or mesoscale heterogeneity characterized by in-plane periodicity that cannot be…
While General Fractional Calculus has successfully expanded the scope of memory operators beyond power-laws, standard formulations remain predominantly restricted to the half-line via Riemann-Liouville or Caputo definitions. This constraint…
The coefficient algebra of a finite-dimensional Lie algebra on a finite-dimensional representation is defined as the subalgebra generated by all coefficients of the corresponding characteristic polynomial. We explore connections between…
It is shown that the free energy associated to a finite dimensional Airy structure is an analytic function at each finite order of the $\hbar$ expansion. Semiclassical series itself is in general divergent. Calculations are facilitated by…
In this paper, we propose a novel approach that harnesses the standard interference function, specifically tailored to address the unique challenges of non-convex optimization in wireless networks. We begin by establishing theoretical…
Given a grading $\Gamma: A=\oplus_{g\in G}A_g$ on a nonassociative algebra $A$ by an abelian group $G$, we have two subgroups of the group of automorphisms of $A$: the automorphisms that stabilize each homogeneous component $A_g$ (as a…
Conventional computer vision models rely on very deep, feedforward networks processing whole images and trained offline with extensive labeled data. In contrast, biological vision relies on comparatively shallow, recurrent networks that…
We describe a novel method for computing sheaf cohomology over weighted projective spaces and stacks using exterior algebra and differential module techniques, generalizing an algorithm due to Eisenbud-Fl\o ystad-Schreyer over projective…