中文
相关论文

相关论文: A Pascal-like Bound for the Number of Necklaces wi…

200 篇论文

The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…

最优化与控制 · 数学 2025-04-28 Hubert Villuendas , Mathieu Besançon , Jérôme Malick

In this paper we compute the coefficients of the reliability polynomial of a consecutive-$k$-out-of-$n$:$F$ system, in Bernstein basis, using the generalized Pascal coefficients. Based on well-known combinatorial properties of the…

离散数学 · 计算机科学 2021-12-14 Vlad-Florin Drăgoi , Simon R. Cowell , Valeriu Beiu

The algebra of densities $\Den(M)$ is a commutative algebra canonically associated with a given manifold or supermanifold $M$. We introduced this algebra earlier in connection with our studies of Batalin--Vilkovisky geometry. The algebra…

数学物理 · 物理学 2017-07-25 H. M. Khudaverdian , Th. Th. Voronov

The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the…

组合数学 · 数学 2008-07-02 Frédéric Meunier

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

逻辑 · 数学 2018-11-08 Robert Goldblatt , Ian Hodkinson

M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 1}$ have discrepancy $O((\log…

数论 · 数学 2018-05-11 Verónica Becher , Olivier Carton

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

数论 · 数学 2020-06-03 Or Ordentlich , Oded Regev , Barak Weiss

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

数据结构与算法 · 计算机科学 2018-09-28 Giovanni Paolini

We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…

组合数学 · 数学 2025-08-12 Lucas Teyssier

We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.

表示论 · 数学 2015-01-27 Yuriy A. Drozd , Vasyl V. Zembyk

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

组合数学 · 数学 2019-05-07 Robert W. Donley,

The study of QCD at finite baryon density is severely hampered by the so-called fermion sign problem. As a result, we have no known first principles approach to study nuclear matter, or neutron stars from QCD. On the surface, the large Nc…

高能物理 - 唯象学 · 物理学 2011-10-27 Aleksey Cherman , Brian C. Tiburzi

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

信息论 · 计算机科学 2015-02-17 Haode Yan , Chunlei Liu

We obtain bounds on the cardinality of $pcf(\mathfrak{a})$ from instances of weak diamond. Consequently, under mild assumptions there are many singular cardinals of the from $\aleph_\delta$ for which…

逻辑 · 数学 2024-05-07 Shimon Garti

We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…

概率论 · 数学 2008-07-11 Geoffrey R. Grimmett , Thomas M. Liggett , Thomas Richthammer

Let $G_n$ denote the $n^{\rm th}$ Gleason polynomial, whose roots correspond to parameters $c$ such that the critical point $0$ is periodic of exact period $n$ under iteration of $z^2 + c$, and let $\bar{G}_n$ denote the reduction of $G_n$…

组合数学 · 数学 2025-09-25 Matthew Baker , Andrea Chen , Sophie Li , Matthew Qian

We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…

数据结构与算法 · 计算机科学 2020-07-01 Noga Alon , Andrei Graur

We prove that sets with positive upper Banach density in sufficiently large dimensions contain congruent copies of all sufficiently large dilates of three specific higher-dimensional patterns. These patterns are: $2^n$ vertices of a fixed…

组合数学 · 数学 2021-10-18 Polona Durcik , Vjekoslav Kovač

We define several notions of a limit point on sequences with domain a barrier in $[\omega]^{<\omega}$ focusing on the two dimensional case $[\omega]^2$. By exploring some natural candidates, we show that countable compactness has a number…

一般拓扑 · 数学 2024-06-26 Cesar Corral , Pourya Memarpanahi , Paul Szeptycki

We consider the Nelson model which describes a quantum system of nonrelativistic identical particles coupled to a possibly massless scalar Bose field through a Yukawa type interaction. We study the limiting behaviour of that model in a…

数学物理 · 物理学 2007-05-23 J. Ginibre , F. Nironi , G. Velo