中文
相关论文

相关论文: Counting on rectangular areas

200 篇论文

In this paper we introduce the concept of polynomial diagrams and its area for special polynomials.We study the properties of polynomial area diagrams. The formula for the area of an arbitrary polynomial diagram.

综合数学 · 数学 2015-02-25 Maksim Alennikov

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…

几何拓扑 · 数学 2009-09-29 Louis H. Kauffman , Sofia Lambropoulou

We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.

代数几何 · 数学 2018-01-15 Laurent Bonavero , Andreas Höring

The purpose of this paper is twofold. First, we define the new spaces and investigate some topological and structural properties. Also, we compute dual spaces of new spaces which are help us in the characterization of matrix mappings.…

泛函分析 · 数学 2016-11-21 Murat Kirisci

A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted…

计算机科学中的逻辑 · 计算机科学 2013-10-28 Zarko Mijajlovic , Aleksandar Pejovic

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

组合数学 · 数学 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

I investigate a class of dynamical systems in which finite pieces of spacetime contain finite amounts of information. Most of the guiding principles for designing these systems are drawn from general relativity: the systems are…

高能物理 - 理论 · 物理学 2007-05-23 David Hillman

Occam's Razor tells us to pick the simplest model that fits our observations. In order to make sense of his process mathematically, we interpret it in the context of posets of functions. Our approach leads to some unusual new combinatorial…

组合数学 · 数学 2015-04-29 William Ralph

Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…

组合数学 · 数学 2009-08-04 S. M. Sadegh Tabatabaei Yazdi , Serap A. Savari

In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not necessarily disjoint or independent). This model deviates from…

信息论 · 计算机科学 2017-08-04 Vaneet Aggarwal , Shuchin Aeron

A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…

离散数学 · 计算机科学 2019-10-04 Barış Evrim Demiröz , Kuban Altınel , Lale Akarun

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

组合数学 · 数学 2016-11-01 Franck Gabriel

We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…

群论 · 数学 2025-09-22 Cesar A. Ipanaque Zapata , Joe Palacios

In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…

组合数学 · 数学 2014-07-23 Felix Breuer

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.

组合数学 · 数学 2014-11-26 Daniel K. Du , Qing-Hu Hou , Charles B. Mei

The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…

算子代数 · 数学 2008-04-16 Mihai Popa

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

组合数学 · 数学 2011-11-29 Srečko Brlek , Jean-Philippe Labbé , Michel Mendès France

Step by step completion of a left-to-right tiling of a rectangular floor with tiles of a single shape starts from one edge of the floor, considers the possible ways of inserting a tile at the leftmost uncovered square, passes through a…

组合数学 · 数学 2014-07-01 Richard J. Mathar

We discuss, following Mikhalkin, Brugall\'e, and many others, the counting of curves on toric surfaces with prescribed genus, Newton polygon, and intersection pattern with the toric boundary divisor, both at assigned and unassigned points.…

代数几何 · 数学 2025-11-27 Thomas Dedieu

In this paper, we show the abundance theorem for log canonical surfaces over fields of positive characteristic.

代数几何 · 数学 2019-02-15 Hiromu Tanaka