Related papers: Bounded rank-one transformations
Variable-length Markov chains on finite quivers provide a natural framework for context-dependent stochastic growth under incidence constraints. I study quiver-valued variable-length Markov chains observed through finite boundary windows…
There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the…
We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…
We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…
In this lecture note, we discuss a fundamental concept, referred to as the {\it characteristic rank}, which suggests a general framework for characterizing the basic properties of various low-dimensional models used in signal processing.…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Let G be a connected linear algebraic group defined over an algebraically closed field k and H be a finite abelian subgroup of G whose order is prime to char(k). We show that the essential dimension of G is bounded from below by rank(H) -…
We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
We prove several results concerning classifications, based on successive observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for membership in a given class of processes, such as the class of all finite order Markov…
A bounded automorphism of a field or a group with trivial approximate centre is definable. In an expansion of a field by a Pfaffian family F of additive endomorphisms such that algebraic closure in the expansion coincides with relative…
Given a rank one measure-preserving system defined by cutting and stacking with spacers, we produce a rank one binary sequence such that its orbit closure under the shift transformation, with its unique {nonatomic} invariant probability, is…
Formal orbifolds are defined in higher dimension. Their \'etale fundamental groups are also defined. It is shown that the fundamental groups of formal orbifolds have certain finiteness property and it is also shown that they can be used to…
Representation learning seeks meaningful sensory representations without supervision and can model aspects of human development. Although many neural networks empirically learn useful features, a principled account of what makes a…
Convergence guarantees for optimization over bounded-rank matrices are delicate to obtain because the feasible set is a non-smooth and non-convex algebraic variety. Existing techniques include projected gradient descent, fixed-rank…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We provide a simple proof of a result, due to G. Alberti, concerning a rank-one property for the singular part of the derivative of vector-valued functions of bounded variation.
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
Given a domain of characteristic zero $R$, we functorially construct a rigid symmetric monoidal stable $\infty$-category whose $K_0$ is $R$, solving a problem of Khovanov. We also functorially construct for any reduced commutative ring $R$…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…