English
Related papers

Related papers: Skew-symmetric Vanishing Lattices and Intersection…

200 papers

Let G be a compact connected Lie group and H, the centralizer of a one-parameter subgroup in G. Combining the ideas of Bott-Samelson resulotions of Schubert varieties and the enumerative formula on a twisted products of 2-spheres obatained…

Algebraic Geometry · Mathematics 2014-04-02 Haibao Duan

Thanks to recent advances in parametric geometry of numbers, we know that the spectrum of any set of $m$ exponents of Diophantine approximation to points in $\mathbb{R}^n$ (in a general abstract setting) is a compact connected subset of…

Number Theory · Mathematics 2022-02-02 Martin Rivard-Cooke , Damien Roy

Let HH_{ab}(H) be the equivariant Hilbert scheme parametrizing the zero dimensional subschemes of the affine plane k^2, fixed under the one dimensional torus T_{ab}={(t^{-b},t^a), t\in k^*} and whose Hilbert function is H. This Hilbert…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Evain

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…

Rings and Algebras · Mathematics 2021-02-08 Leonard Kwuida , Claudia Mureşan

Supersymmetry in the gauge sector could be realized as N=1 or N=2 Supersymmetry, but the current LHC searches assume an N=1 realization. In this paper we show that squarks could be as light as few hundreds of GeV for N=2. We also describe…

High Energy Physics - Phenomenology · Physics 2015-06-03 Matti Heikinheimo , Moshe Kellerstein , Veronica Sanz

Points in the intersection of Schubert varieties are counted by various combinatorial objects, for example standard tableaux. This paper consider the problem of producing a natural labelling of intersection points by these combinatorial…

Representation Theory · Mathematics 2019-12-24 Noah White

We show that the set of totally positive unipotent lower-triangular Toeplitz matrices in $GL_n$ form a real semi-algebraic cell of dimension $n-1$. Furthermore we prove a natural cell decomposition for its closure. The proof uses properties…

Quantum Algebra · Mathematics 2007-05-23 Konstanze Rietsch

We investigate the line arrangement that results from intersecting d complete flags in C^n. We give a combinatorial description of the matroid T_{n,d} that keeps track of the linear dependence relations among these lines. We prove that the…

Combinatorics · Mathematics 2007-05-23 Federico Ardila , Sara Billey

Let G be a simply-connected simple compact Lie group over the complex numbers. The affine Grassmannian is a projective ind-variety, homotopy-equivalent to the loop space of G and closely analogous to a maximal flag variety of the classical…

Algebraic Geometry · Mathematics 2007-12-19 Sara C. Billey , Stephen A. Mitchell

We study the back stable Schubert calculus of the infinite flag variety. Our main results are: 1) a formula for back stable (double) Schubert classes expressing them in terms of a symmetric function part and a finite part; 2) a novel…

Combinatorics · Mathematics 2021-07-01 Thomas Lam , Seung Jin Lee , Mark Shimozono

An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. Gupta et al. (2012,\cite{Gupta}) showed that every $n$-vertex graph has at most $10^{\frac{n}{5}}\approx 1.5849^n$ maximal induced matchings,…

Combinatorics · Mathematics 2024-10-16 Bo-Jun Yuan , Zhao-Yu Yang , Lu Zheng , Shi-Cai Gong

Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this…

Number Theory · Mathematics 2017-06-12 Shane Chern

For $\mu$ given latin squares of order $n$, they have {\sf $k$ intersection} when they have $k$ identical cells and $n^2-k$ cells with mutually different entries. For each $n\geq 1$ the set of integers $k$ such that there exist $\mu$ latin…

Combinatorics · Mathematics 2015-09-17 P. Adams , E. S. Mahmoodian , H. Minooei , M. Mohammadi Nevisi

The unknotting number of a positive braid with n strands and k intersections is known to be equal to (k-n+1)/2. We consider Lorenz knots (which are positive braids) and, using a different method, find their unknotting numbers in terms of…

Geometric Topology · Mathematics 2015-03-04 Lilya Lyubich

How many copies of a parallelepiped are needed to ensure that for every point in the parallelepiped a copy of each other point exists, such that the distance between them equals the distance of the pair of points when the opposite sites of…

Computational Geometry · Computer Science 2018-07-18 Senja Barthel

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…

Number Theory · Mathematics 2012-05-16 Pentti Haukkanen , Jorma K. Merikoski

We study Seifert linking form which is an invariant of embeddings of punctured $n$-manifolds in $\mathbb R^{2n-1}$. For punctured $n$-manifold $N_0$ the values of this invariant are integer valued bilinear symmetric forms on…

Geometric Topology · Mathematics 2021-07-08 Mikhail Fedorov

For all $n > k \ge 1$, we give formulas for the nullity $N(n,k)$ of the $n \times n$ skew-symmetric Toeplitz band matrix whose first $k$ superdiagonals have all entries $1$ and whose remaining superdiagonals have all entries $0$. This is…

Combinatorics · Mathematics 2020-02-10 Ron Evans , John Greene , Mark Van Veen

We show that every pair of longest paths in a $k$-connected graph on $n$ vertices intersect each other in at least $(8k-n+2)/5$ vertices. We also show that, in a 4-connected graph, every pair of longest paths intersect each other in at…

Combinatorics · Mathematics 2020-08-06 Juan Gutiérrez

We prove that the number of symmetric chain decompositions of the Boolean lattice $2^{[n]}$ is $$\left(\frac{n}{2e}+o(n)\right)^{2^n}.$$ Furthermore, the number of symmetric chain decompositions of the hypergrid $[t]^n$ is…

Combinatorics · Mathematics 2024-05-16 István Tomon