中文
相关论文

相关论文: The Generalized Sylvester's And Orchard Problems V…

200 篇论文

Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep results as the Baik-Deift-Johansson Theorem that connect it…

组合数学 · 数学 2007-05-23 Alexander Burstein , Isaiah Lankham

The recent proposal by Ben-Zvi, Sakellaridis and Venkatesh of a duality in the relative Langlands program, leads, via the process of quantization of Hamiltonian varieties, to a duality theory of branching problems. This often unexpectedly…

表示论 · 数学 2025-07-28 Wee Teck Gan , Bryan Wang Peng Jun

We extend to a scheme-theoretic context the notion of a combinatorial differential form, due to A.Kock in the framework of synthetic differential geometry. We show that group-valued combinatorial forms on a scheme may be identified, under…

代数几何 · 数学 2007-05-23 Lawrence Breen , William Messing

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…

组合数学 · 数学 2010-10-20 Gregory S. Warrington

In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…

组合数学 · 数学 2023-06-07 Arthur Gonçalves Fidalgo

Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…

组合数学 · 数学 2020-04-03 Brendon Rhoades , Tianyi Yu , Zehong Zhao

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

组合数学 · 数学 2020-03-05 Sami H. Assaf

The original Pak-Stanley labeling was defined by Pak and Stanley as a bijective map from the set of regions of an extended Shi arrangement to the set of parking functions. This map was later generalized to other arrangements associated with…

组合数学 · 数学 2020-11-23 Mikhail Mazin , Joshua Miller

We re-prove the classification of flexible octahedra, obtained by Bricard at the beginning of the XX century, by means of combinatorial objects satisfying some elementary rules. The explanations of these rules rely on the use of a…

度量几何 · 数学 2021-03-04 Matteo Gallet , Georg Grasegger , Jan Legerský , Josef Schicho

We develop a systematic way for constructing bispectral algebras of commuting ordinary differential operators of any rank $N$. It combines and unifies the ideas of Duistermaat-Gr\"unbaum and Wilson. Our construction is completely…

q-alg · 数学 2009-10-30 B. Bakalov , E. Horozov , M. Yakimov

On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…

综合数学 · 数学 2007-05-23 Linfan Mao

We introduce a new approach to the enumeration of rational slope parking functions with respect to the area and a generalized dinv statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our…

组合数学 · 数学 2016-09-30 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…

组合数学 · 数学 2023-09-12 Priyavrat Deshpande , Krishna Menon , Writika Sarkar

We define iteration of functions that map n-dimensional vector spaces into m-dimensional vector spaces (m at most equal to n). It happens that usual iteration and Fibonacci iterative methods become special cases of this generalized…

动力系统 · 数学 2008-03-08 Andrei Vieru

We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…

组合数学 · 数学 2025-03-17 Maria Gillespie , Andrew Reimer-Berg

In the recent paper [arXiv:1612.06893] P. B\"urgisser and A. Lerario introduced a geometric framework for a probabilistic study of real Schubert Problems. They denoted by $\delta_{k,n}$ the average number of projective $k$-planes in…

代数几何 · 数学 2019-12-19 Antonio Lerario , Léo Mathis

This is the first in a series of papers in which we describe explicit structural properties of spaces of diagonal rectangular harmonic polynomials in $k$ sets of $n$ variables, both as $GL_k$-modules and $S_n$-modules, as well as some of…

组合数学 · 数学 2020-03-18 François Bergeron

We lay the foundations for a broad algebraic theory encompassing SICs in the hope of elucidating their heuristic connections with Stark units. What emerges is a greatly generalised set-up with added structure and potential for applications…

数论 · 数学 2025-09-23 David Solomon

In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…

离散数学 · 计算机科学 2013-12-11 Pietro Codara , Ottavio M. D'Antona , Pavol Hell

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

综合数学 · 数学 2009-09-29 Linfan Mao