Related papers: Simple criteria for higher rational singularities
Linearly projecting smooth projective varieties provides a method of obtaining hypersurfaces birational to the original varieties. We show that in low dimension, the resulting hypersurfaces only have Du Bois singularities. Moreover, we…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.
We give criteria for Morin singularities into higher dimensions. As an application, we study the number of A-isotopy classes of Morin singularities.
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.
A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…
In this paper, we define a Dolbeault complex with weights according to normal crossings, which is a useful tool for studying the d-bar-equation on singular complex spaces by resolution of singularities (where normal crossings appear…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
We study the singularities of secant varieties of smooth projective varieties using methods from birational geometry when the embedding line bundle is sufficiently positive. More precisely, we study the Du Bois complex of secant varieties…
We show that the wall crossing bijections between simples of the category O of the rational Cherednik algebras reduce to particular crystal isomorphisms which can be computed by a simple combinatorial procedure on multipartitions of fixed…
We establish the boundedness character of solutions of a system of rational difference equations with a variable coefficient
The aim of this paper is to show how a conjectural lower bound on the canonical height function in the spirit of Lang and Silverman leads to an explicit uniform bound on the number of rational points on curves of genus $g\geq 2$ over a…
We give characterizations for the parabolicity of regular trees.
We prove that the minimal exponent for local complete intersections satisfies an Inversion-of-Adjunction property. As a result, we also obtain the Inversion of Adjunction for higher Du Bois and higher rational singularities for local…
Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.
Even though classic theories and models of discrete choice pose man as a rational being, it has been shown extensively that people persistently violate rationality in their actual choices. Recent models of decision-making take these…
We propose an approach for showing rationality of an algebraic variety $X$. We try to cover $X$ by rational curves of certain type and count how many curves pass through a generic point. If the answer is $1$, then we can sometimes reduce…