Related papers: Bounded rank-one transformations
Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…
We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…
In many Lagrangian field theories one has a Poisson bracket defined on the space of local functionals. We find necessary and sufficient conditions for a transformation on the space of local functionals to be canonical in three different…
We study log canonical thresholds (also called global log canonical threshold or $\alpha$-invariant) of $\mathbb{R}$-linear systems. We prove existence of positive lower bounds in different settings, in particular, proving a conjecture of…
In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…
We show that for any integer n and any field k of characteristic different from 2 there are at most finitely many isomorphism classes of quadratic morphisms from the projective line over k to itself with a finite postcritical orbit of size…
The Zariski closure of the boundary of the set of matrices of nonnegative rank at most 3 is reducible. We give a minimal generating set for the ideal of each irreducible component. In fact, this generating set is a Grobner basis with…
The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…
Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths -- a result that shows a strong link between the properties of these graph classes considered from the…
We introduce a unified framework based on bi-level optimization schemes to deal with parameter learning in the context of image processing. The goal is to identify the optimal regularizer within a family depending on a parameter in a…
We introduce the decomposition rank, a notion of covering dimension for nuclear C^*-algebras. The decomposition rank generalizes ordinary covering dimension and has nice permanence properties; in particular, it behaves well with respect to…
In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class $1$ functions. A rank is a function assigning countable ordinals to certain objects, typically measuring their complexity. We extend this theory…
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…
In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…
A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a…
For operators defined on locally convex spaces we define the notions of boundedness and ergodicity associated to an infinite matrix. Given two matrices $ A$ and $ B$, we study when $ A$-bounded operators are $ B$-ergodic. Using this…
We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on $\mathbb P^1$, using the same types of basic operations as in the Katz-Deligne-Arinkin algorithm for rigid irregular…
Most elementary numerical schemes found useful for solving classical trajectory problems are {\it canonical transformations}. This fact should be make more widely known among teachers of computational physics and Hamiltonian mechanics. From…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…