English
Related papers

Related papers: A combinatorial proof of the $\lambda_g$ conjectur…

200 papers

We associate determinant lines to objects of the extended abelian category built out of a von Neumann category with a trace. Using this we suggest constructions of the combinatorial and the analytic L^2 torsions which, unlike the work of…

Differential Geometry · Mathematics 2007-05-23 M. Braverman , A. Carey , M. Farber , V. Mathai

The combinatorial invariance conjecture (due independently to G. Lusztig and M. Dyer) predicts that if $[x,y]$ and $[x',y']$ are isomorphic Bruhat posets (of possibly different Coxeter systems), then the corresponding Kazhdan-Lusztig…

Representation Theory · Mathematics 2022-05-13 Gaston Burrull , Nicolas Libedinsky , David Plaza

We classify indecomposable pure injective modules over domestic string algebras, verifying Ringel's conjecture on the structure of such modules.

Representation Theory · Mathematics 2015-09-15 Gena Puninski , Mike Prest

In this paper we prove Conjecture \ref{conj1} for a set of representations of the group $GL_n({\bf A})$. This Conjecture is stated in complete generality as Conjecture 1 in \cite{G2}, and here we prove it for various cases. See Conjecture…

Number Theory · Mathematics 2016-09-20 David Ginzburg

In this paper we present a combinatorial proof of Selberg's integral formula. We start by giving a bijective proof of a Theorem about the number of topological orders of a certain related directed graph. Selberg's Integral Formula then…

Combinatorics · Mathematics 2020-05-19 Alexander Haupt

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Combinatorics · Mathematics 2017-05-12 Christian Bean , Bjarki Gudmundsson , Henning Ulfarsson

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Combinatorics · Mathematics 2014-06-17 Reinhard Diestel , Sang-il Oum

We provide an elementary proof of a lemma that plays an important role in the classification of parallel mean curvature surfaces in two-dimensional complex space forms.

Differential Geometry · Mathematics 2025-11-04 Katsuei Kenmotsu

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

Logic in Computer Science · Computer Science 2013-03-27 Ariel Fernández , Michael Soltys

We give bounds for the module sectional category of products of maps which generalise a theorem of Jessup for Lusternik-Schnirelmann category. We deduce also a proof of a Ganea type conjecture for topological complexity. This is a first…

Algebraic Topology · Mathematics 2015-06-15 J. G. Carrasquel-Vera

We propose a log-concavity conjecture for BPS invariants arising in the enumerative geometry of planar curve singularities, identified with the local Euler obstructions of Severi strata in their versal deformations. We further extend this…

Algebraic Geometry · Mathematics 2026-05-01 Tao Su , Baiting Xie , Chenglong Yu

We study a natural analogue of Collatz's Conjecture for polynomials over $\mathbb{F}_2$.

Number Theory · Mathematics 2025-10-10 Luis H. Gallardo , Olivier Rahavandrainy

We give a combinatorial proof that congruence permutability is prime in the lattice of interpretability types of varieties. Thereby, we settle a 1984 conjecture of Garcia and Taylor.

Combinatorics · Mathematics 2021-07-20 Gergő Gyenizse , Miklós Maróti , László Zádori

We propose a computational modeling framework for inducing combinatory categorial grammars from arbitrary behavioral data. This framework provides the analyst fine-grained control over the assumptions that the induced grammar should conform…

Computation and Language · Computer Science 2020-10-19 Gene Louis Kim , Aaron Steven White

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We derive effective recursion formulae of top intersections in the tautological ring $R^*(M_g)$ of the moduli space of curves of genus $g\geq 2$. As an application, we prove a convolution-type tautological relation in $R^{g-2}(M_g)$.

Algebraic Geometry · Mathematics 2013-03-28 Kefeng Liu , Hao Xu

We provide a complete, self-contained proof that reduces second-order generators of the quantum argument-shift algebra in the universal enveloping algebra $U\mathfrak{gl}_d$. We prove the necessary combinatorial identities -- expressed as…

Quantum Algebra · Mathematics 2025-10-02 Yasushi Ikeda

We study a problem on edge percolation on product graphs $G\times K_2$. Here $G$ is any finite graph and $K_2$ consists of two vertices $\{0,1\}$ connected by an edge. Every edge in $G\times K_2$ is present with probability $p$ independent…

Combinatorics · Mathematics 2009-11-30 Svante Linusson

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

We derive a class of solutions to the string sigma-model equations for the closed bosonic string. The tachyon field is taken to form a constant condensate and the beta-function equations at one-loop level are solved for the evolution of the…

High Energy Physics - Theory · Physics 2009-09-25 Alan Kostelecky , Malcolm Perry
‹ Prev 1 8 9 10 Next ›