相关论文: On quasiregular linearizers

Without Lorentz symmetry, generic fixed points of the renormalization group (RG) are labelled by their dynamical (or `Lifshitz') exponent $z$. Hence, a rich variety of possible RG flows arises. The first example is already given by the…

Kullback-Leibler divergence (KL) regularization is widely used in reinforcement learning, but it becomes infinite under support mismatch and can degenerate in low-noise limits. Utilizing a unified information-geometric framework, we…

We present a new kind of normalization theorem: linearization theorem for skew products. The normal form is a skew product again, with the fiber maps linear. It appears, that even in the smooth case, the conjugacy is only H\"older…

Let $K$ be a complete ultrametric field of charactersitic zero whose corresponding residue field $\Bbbk$ is also of charactersitic zero. We give lower and upper bounds for the size of linearization disks for power series over $K$ near an…

In earlier papers the author studied some classes of equations with Carlitz derivatives for $\mathbb F_q$-linear functions, which are the natural function field counterparts of linear ordinary differential equations. Here we consider…

The use of denoisers for image reconstruction has shown significant potential, especially for the Plug-and-Play (PnP) framework. In PnP, a powerful denoiser is used as an implicit regularizer in proximal algorithms such as ISTA and ADMM.…

Let $X$ be a variety defined over an algebraically closed field $k$ of characteristic $0$, let $N\in\mathbb{N}$, let $g:X\dashrightarrow X$ be a dominant rational self-map, and let $A:\mathbb{A}^N\to \mathbb{A}^N$ be a linear transformation…

The Kardar-Parisi-Zhang (KPZ) equation sets the universality class for growing and roughening of nonequilibrium surfaces without any conservation law and nonlocal effects. We argue here that the KPZ equation can be generalized by including…

This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

In plug-and-play (PnP) regularization, the knowledge of the forward model is combined with a powerful denoiser to obtain state-of-the-art image reconstructions. This is typically done by taking a proximal algorithm such as FISTA or ADMM,…

We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…

This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…

We show that the cohomology ring of a quiver Grassmannian asssociated with a rigid quiver representation has property (S): there is no odd cohomology and the cycle map is an isomorphism; moreover, its Chow ring admits explicit generators…

We consider the problem of topological linearization of smooth (C infinity or real analytic) control systems, i.e. of their local equivalence to a linear controllable system via point-wise transformations on the state and the control…

We give new characterizations of the algebra $\mathscr{L}_n(\mathbb{F}_{q^n})$ formed by all linearized polynomials over the finite field $\mathbb{F}_{q^n}$ after briefly surveying some known ones. One isomorphism we construct is between…

We give a local characterization for when certain quiver representations in semisimple Abelian categories are semisimple, among them those arising from degenerations of linear series. This paper is the first of two, aimed to describe all…

Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…