English
Related papers

Related papers: Rank Selection and Depth Conditions for Balanced S…

200 papers

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

Combinatorics · Mathematics 2018-12-21 Anna Gundert

The purpose of this article is to present my new proof of the the construction and the convergence theorem of spectral sequences of filtered complexes, which is much shorter and cleaner than the "standard" proof.

Rings and Algebras · Mathematics 2020-02-18 Rui Xiong

We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…

Dynamical Systems · Mathematics 2026-04-22 Shigenori Takeda

We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…

Algebraic Geometry · Mathematics 2020-03-03 Khazhgali Kozhasov

We show that any closed model category of simplicial algebras over an algebraic theory is Quillen equivalent to a proper closed model category. By ``simplicial algebra'' we mean any category of algebras over a simplicial algebraic theory,…

Algebraic Topology · Mathematics 2008-12-05 Charles Rezk

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

Rings and Algebras · Mathematics 2016-03-16 Robert Egrot

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Optimization and Control · Mathematics 2019-06-06 Victor Magron , Pierre-Loic Garoche , Didier Henrion , Xavier Thirioux

Let $A$ be a separable, unital, simple C*-algebra with stable rank one. We show that every strictly positive, lower semicontinuous, affine function on the simplex of normalized quasitraces of $A$ is realized as the rank of an operator in…

Operator Algebras · Mathematics 2019-04-26 Hannes Thiel

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

Algebraic Geometry · Mathematics 2020-07-20 David Kazhdan , Tamar Ziegler

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…

Information Theory · Computer Science 2016-11-15 Yudong Chen

In this paper we study the low rank matrix completion problem using tools from Schur complement. We give a sufficient and necessary condition such that the completed matrix is globally unique with given data. We assume the observed entries…

Optimization and Control · Mathematics 2022-07-01 Fei Wang

Let $I\subset S=\KK[x_1,...,x_n]$ be a lexsegment ideal, generated by monomials of degree $d$. The main aim of this paper is to characterize when the Hilbert depth of $I$ will be 1, in the standard graded case. In addition to this, we will…

Commutative Algebra · Mathematics 2012-08-10 Yi-Huang Shen

The scale and complexity of modern data sets and the limitations associated with testing large numbers of hypotheses underline the need for feature selection methods. Spectral techniques rank features according to their degree of…

Machine Learning · Statistics 2018-11-09 Kiya W. Govek , Venkata S. Yamajala , Pablo G. Camara

We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…

Combinatorics · Mathematics 2024-03-05 Gemma De las Cuevas , Matt Hoogsteder Riera , Tim Netzer

In many cases (e.g. for many Segre or Segre embeddings of multiprojective spaces) we prove that a hypersurface of the $b$-secant variety of $X\subset \mathbb {P}^r$ has $X$-rank $>b$. We prove it proving that the $X$-rank of a general point…

Algebraic Geometry · Mathematics 2017-08-04 Edoardo Ballico

For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed…

Numerical Analysis · Mathematics 2017-09-08 Jiawang Nie

We extend Langton's valuative criterion for families of coherent algebraic sheaves to a complex analytic set-up. As a consequence we derive a set of sufficient conditions for the compactness of a moduli space of semistable sheaves over a…

Algebraic Geometry · Mathematics 2021-08-30 Matei Toma

In this paper we study the identifiability of specific forms (symmetric tensors), with the target of extending recent methods for the case of $3$ variables to more general cases. In particular, we focus on forms of degree $4$ in $5$…

Algebraic Geometry · Mathematics 2022-03-08 Elena Angelini , Luca Chiantini

Some sufficient conditions on a simplicial space $X$ guaranteeing that $X_1\simeq \Omega|X|$ were given by Segal. We give a generalization of this result for multisimplicial spaces. This generalization is appropriate for the reduced bar…

Algebraic Topology · Mathematics 2015-04-14 Zoran Petric

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner