English
Related papers

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

200 papers

We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…

Probability · Mathematics 2022-05-04 Omer Bobrowski , Dmitri Krioukov

The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner…

Commutative Algebra · Mathematics 2023-05-31 Raheleh Jafari , Ali Akbar Yazdan Pour

We investigate the smoothing problem of limit linear series of rank one on an enrichment of the notions of nodal curves and metrized complexes called saturated metrized complexes. We give a finitely verifiable full criterion for…

Algebraic Geometry · Mathematics 2017-07-03 Ye Luo , Madhusudan Manjunath

Iterated Segre mappings of real analytic generic submanifolds in complex space have been an essential tool in the study of holomorphic, formal, and CR mappings between such manifolds. In this paper we present a theory of iterated Segre…

Complex Variables · Mathematics 2007-05-23 M. S. Baouendi , P. Ebenfelt , Linda Preiss Rothschild

Let S be a nonsingular projective surface. Each vector bundle V on S of rank s induces a tautological vector bundle over the Hilbert scheme of n points of S. When s=1, the top Segre classes of the tautological bundles are given by a…

Algebraic Geometry · Mathematics 2021-07-20 Alina Marian , Dragos Oprea , Rahul Pandharipande

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Combinatorics · Mathematics 2021-03-08 Christos A. Athanasiadis , Eleni Tzanaki

The singular simplicial set Sing(X) of a space X completely captures its weak homotopy type. We introduce a category of_controlled sets_, yielding _simplicial controlled sets_, such that one can functorially produce a singular simplicial…

Algebraic Topology · Mathematics 2009-03-04 Viêt-Trung Luu

We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…

Computational Complexity · Computer Science 2016-05-11 Adam Kurpisz , Samuli Leppänen , Monaldo Mastrolilli

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

Combinatorics · Mathematics 2023-05-08 Alejandro Vargas

We catalog some simple conditions which are sufficient to guarantee that R-parity survives as an unbroken gauged discrete subgroup of the continuous gauge symmetry in certain supersymmetric extensions of the standard model.

High Energy Physics - Phenomenology · Physics 2009-12-30 Stephen P. Martin

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

Numerical Analysis · Mathematics 2024-12-20 Ilse C. F. Ipsen , Arvind K. Saibaba

We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…

Computer Vision and Pattern Recognition · Computer Science 2015-05-05 Alexander Shekhovtsov

We introduce a refinement of persistent homology that detects simple-homotopy-theoretic phenomena invisible to homology. Given a filtered simplicial complex, we define the Morse complexity profile as the minimal number of critical simplices…

Algebraic Topology · Mathematics 2026-04-14 Divya Ahuja , Jaya NN Iyer

This paper introduces two complexity-theoretic formulations of Bennett's logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow…

Computational Complexity · Computer Science 2007-07-13 David Doty , Philippe Moser

In this paper we develop further the multi-parameter model of random simplicial complexes. Firstly, we give an intrinsic characterisation of the multi-parameter probability measure. Secondly, we show that in multi-parameter random…

Algebraic Topology · Mathematics 2015-03-24 A. Costa , M. Farber

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Classical Analysis and ODEs · Mathematics 2010-10-27 Neil Lyall , Akos Magyar

Let $X(\mathbb {C})\subset \mathbb {P}^r(\mathbb {C})$ be an integral non-degenerate variety defined over $\mathbb {R}$. For any $q\in \mathbb {P}^r(\mathbb {R})$ we study the existence of $S\subset X(\mathbb {C})$ with small cardinality,…

Algebraic Geometry · Mathematics 2019-06-11 Edoardo Ballico

We develop some new aspects of cohomology in the context of semi-abelian categories: we establish a Hochschild-Serre 5-term exact sequence extending the classical one for groups and Lie algebras; we prove that an object is perfect if and…

K-Theory and Homology · Mathematics 2007-11-14 Marino Gran , Tim Van der Linden

We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the…

Quantum Physics · Physics 2007-05-23 Hao Chen

In this paper, we provide a method to learn the directed structure of a Bayesian network using data. The data is accessed by making conditional probability queries to a black-box model. We introduce a notion of simplicity of representation…

Machine Learning · Computer Science 2021-02-19 Adarsh Barik , Jean Honorio
‹ Prev 1 8 9 10 Next ›