中文
相关论文

相关论文: Elementary proof techniques for the maximum number…

200 篇论文

Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case.…

交换代数 · 数学 2014-01-14 N. Dück , K. -H. Zimmermann

In this paper a new mathematical procedure is presented for combining different pieces of evidence which are represented in the interval form to reflect our knowledge about the truth of a hypothesis. Evidences may be correlated to each…

人工智能 · 计算机科学 2013-04-05 L. W. Chang , Rangasami L. Kashyap

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

组合数学 · 数学 2013-03-25 Michal Adamaszek

In this note, we point out that in the eternal inflation driven by the metastable vacua of the landscape, it might be possible that some large and local quantum fluctuations with the null energy condition violation can stride over the…

广义相对论与量子宇宙学 · 物理学 2008-11-26 Yun-Song Piao

The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…

代数几何 · 数学 2010-03-18 Z. Izhakian , E. Shustin

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

数据结构与算法 · 计算机科学 2026-05-05 Samuel Boardman

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

组合数学 · 数学 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

We show how solutions to many recursive arena equations can be computed in a natural way by allowing loops in arenas. We then equip arenas with winning functions and total winning strategies. We present two natural winning conditions…

计算机科学中的逻辑 · 计算机科学 2010-01-06 Pierre Clairambault

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

交换代数 · 数学 2026-03-03 Sara Kališnik , Davorin Lešnik

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

信息论 · 计算机科学 2020-12-08 Pavel Pudlák

We study the tropicalization of intersections of plane curves, under the assumption that they have the same tropicalization. We show that the set of tropical divisors that arise in this manner is a pure dimensional balanced polyhedral…

代数几何 · 数学 2019-05-02 Yoav Len , Matthew Satriano

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

组合数学 · 数学 2023-05-08 Alejandro Vargas

We study representations of tropical linear spaces as intersections of tropical hyperplanes of circuits. For several classes of matroids, we describe minimal tropical bases. We also show that every realizable tropical linear space has a…

组合数学 · 数学 2007-05-23 Josephine Yu , Debbie S. Yuster

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

组合数学 · 数学 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

组合数学 · 数学 2017-10-03 Michał Lasoń

We develop the basic theory of projective modules and splitting in the more general setting of systems. Systems provide a common language for most tropical algebraic approaches including supertropical algebra, hyperrings (specifically…

交换代数 · 数学 2019-04-16 Jaiung Jun , Kalina Mincheva , Louis Rowen

We classify the singularities of a surface ruled by conics: they are rational double points of type $A_n$ or $D_n$. This is proved by showing that they arise from a precise series of blow-ups of a suitable surface geometrically ruled by…

代数几何 · 数学 2012-11-07 Michela Brundu , Gianni Sacchiero

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

计算机科学中的逻辑 · 计算机科学 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

We generalize the level set approach to model epitaxial growth to include thermal detachment of atoms from island edges. This means that islands do not always grow and island dissociation can occur. We make no assumptions about a critical…

材料科学 · 物理学 2009-11-07 M. Petersen , C. Ratsch , R. E. Caflisch , A. Zangwill

We propose a classification of all one-dimensional discrete statistical models with maximum likelihood degree one based on their rational parametrization. We show how all such models can be constructed from members of a smaller class of…

组合数学 · 数学 2025-06-12 Arthur Bik , Orlando Marigliano