中文
相关论文

相关论文: Cactus, Pascal, and Pappus Point-Line Configuratio…

200 篇论文

A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…

组合数学 · 数学 2021-06-16 Rigoberto Flórez , Thomas Zaslavsky

We study a class of determinantal ideals arising from conditional independence (CI) statements with hidden variables. Such CI statements translate into determinantal conditions on a matrix whose entries represent the probabilities of events…

组合数学 · 数学 2025-10-15 Emiliano Liwski

The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…

泛函分析 · 数学 2012-05-03 Heinz H. Bauschke , D. Russell Luke , Hung M. Phan , Xianfu Wang

A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…

组合数学 · 数学 2013-01-14 Sergio Hiroki Koike-Quintanar , István Kovács , Tomaž Pisanski

We consider decompositions of topes of the oriented matroid realizable as the arrangement of coordinate hyperplanes in $\mathbb{R}^{2^t}$, with respect to a distinguished symmetric $2\cdot 2^t$-cycle in its hypercube graph of topes…

组合数学 · 数学 2021-08-04 Andrey O. Matveev

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…

We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to compare elements of mixed dimension, we…

泛函分析 · 数学 2019-11-14 Peter G. Casazza , John I. Haas , Joshua Stueck , Tin T. Tran

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

代数几何 · 数学 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

The aim of this paper is to give a constructive proof of one of the basic theorems of tropical geometry: given a point on a tropical variety (defined using initial ideals), there exists a Puiseux-valued ``lift'' of this point in the…

代数几何 · 数学 2009-07-28 Anders Nedergaard Jensen , Hannah Markwig , Thomas Markwig

An exact solution to a family of parity check error-correcting codes is provided by mapping the problem onto a Husimi cactus. The solution obtained in the thermodynamic limit recovers the replica symmetric theory results and provides a very…

无序系统与神经网络 · 物理学 2009-10-31 Renato Vicente , David Saad , Yoshiyuki Kabashima

In the present work we study parameter spaces of two line point configurations introduced by B\"or\"oczky. These configurations are extremal from the point of view of Dirac-Motzkin Conjecture settled recently by Green and Tao. They have…

代数几何 · 数学 2018-03-20 Magdalena Lampa-Baczynska , Justyna Szpond

The problem of matroid-reachability-based packing of arborescences was solved by Kir\'aly. Here we solve the corresponding decomposition problem that turns out to be more complicated. The result is obtained from the solution of the more…

组合数学 · 数学 2024-05-07 Florian Hörsch , Benjamin Peyrille , Zoltán Szigeti

Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…

泛函分析 · 数学 2022-08-05 Gunther Dirr

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

泛函分析 · 数学 2017-03-16 Mohan Ravichandran

In this paper we present some fixed-figure theorems as a geometric approach to the fixed-point theory when the number of fixed points of a self-mapping is more than one. To do this, we modify the Jleli-Samet type contraction and define new…

度量几何 · 数学 2021-08-19 Hülya Atyimur , Nihal Taş

We present several algebraic and differential-geometric constructions of tetrahedron maps, which are set-theoretical solutions to the Zamolodchikov tetrahedron equation. In particular, we obtain a family of new (nonlinear) polynomial…

可精确求解与可积系统 · 物理学 2022-10-12 Sergei Igonin , Sotiris Konstantinou-Rizos

We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…

组合数学 · 数学 2014-04-09 Zvi Rosen

Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…

数据结构与算法 · 计算机科学 2018-11-27 Marek Adamczyk , Michał Włodarczyk

Given n subspaces of a finite-dimensional vector space over a fixed finite field $\mathbb F$, we wish to find a linear layout $V_1,V_2,\ldots,V_n$ of the subspaces such that $\dim((V_1+V_2+\cdots+V_i) \cap (V_{i+1}+\cdots+V_n))\le k$ for…

数据结构与算法 · 计算机科学 2018-05-16 Jisu Jeong , Eun Jung Kim , Sang-il Oum