中文
相关论文

相关论文: Bounds on ordered codes and orthogonal arrays

200 篇论文

We study the cohomology of spaces of string links and braids in $\mathbb{R}^n$ for $n\geq 3$ using configuration space integrals. For $n>3$, these integrals give a chain map from certain diagram complexes to the deRham algebra of…

代数拓扑 · 数学 2010-02-15 Ismar Volic

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

符号计算 · 计算机科学 2011-11-10 Jean-Guillaume Dumas

We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we…

组合数学 · 数学 2014-12-18 Tobias Finis , Erez Lapid

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

组合数学 · 数学 2022-12-13 Benjamin Peet

The paper provides a combinatorial method to decide when the space of local systems with non vanishing first cohomology on the complement to an arrangement of lines in a complex projective plane has as an irreducible component a subgroup of…

组合数学 · 数学 2007-05-23 A. Libgober , S. Yuzvinsky

We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of…

度量几何 · 数学 2020-04-17 Derek Kitson , Anthony Nixon , Bernd Schulze

We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…

经典分析与常微分方程 · 数学 2015-04-25 Huda Alsaud , Alexander Kushpel , Jeremy Levesley

With a computer-aided approach based on the connection with equitable partitions, we establish the uniqueness of the orthogonal array OA$(1536,13,2,7)$, constructed in [D.G.Fon-Der-Flaass. Perfect $2$-Colorings of a Hypercube, Sib. Math. J.…

组合数学 · 数学 2019-12-10 Denis S. Krotov

A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…

组合数学 · 数学 2022-09-14 Edgar Jaramillo-Rodriguez

It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads. The…

范畴论 · 数学 2016-09-07 M. A. Batanin

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

经典分析与常微分方程 · 数学 2008-02-03 Anne de Médicis , Dennis W. Stanton

We consider the "limiting behavior" of *discriminants*, by which we mean informally the locus in some parameter space of some type of object where the objects have certain singularities. We focus on the space of partially labeled points on…

代数几何 · 数学 2015-11-03 Ravi Vakil , Melanie Matchett Wood

We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as…

度量几何 · 数学 2019-01-21 Konrad J. Swanepoel

We characterize the orderings of pairs of sets induced by several distances: Hamming, Jaccard, S\o rensen-Dice and Overlap. We also characterize these distances.

离散数学 · 计算机科学 2025-07-09 Thierry Marchant , Sandip Sarkar

Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…

经典分析与常微分方程 · 数学 2020-02-13 Plamen Iliev , Yuan Xu

In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…

组合数学 · 数学 2025-05-14 Emanuele Delucchi , Lukas Kühne , Leonie Mühlherr

In this paper, the concept of grand variable Herz-Morrey-Hardy spaces are introduced. We also establish the atomic characterization of these spaces. As an application the authors investigate the continuity of a few singular integral…

泛函分析 · 数学 2025-08-26 Babar Sultan , Amjad Hussain , Mehvish Sultan

Characteristic elements of the Tits algebra of a real hyperplane arrangement carry information about the characteristic polynomial. We present this notion and its basic properties, and apply it to derive various results about the…

组合数学 · 数学 2019-02-21 Marcelo Aguiar , Jose Bastidas , Swapneel Mahajan

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

数学物理 · 物理学 2017-06-19 J. P. Keating , N. Linden , H. J. Wells