找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Near Polygons; Bart Bruyn Book 2006Latest edition The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nat

[復(fù)制鏈接]
查看: 12171|回復(fù): 46
樓主
發(fā)表于 2025-3-21 17:15:11 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Near Polygons
編輯Bart Bruyn
視頻videohttp://file.papertrans.cn/663/662303/662303.mp4
概述Accessible to general mathematical audience.This is an important book. It fills a gap in the literature ... The author is presently the major authority on this topic. He is indeed the right author for
叢書名稱Frontiers in Mathematics
圖書封面Titlebook: Near Polygons;  Bart Bruyn Book 2006Latest edition The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nat
描述.Near polygons were introduced about 25 years ago and studied intensively in the 1980s. In recent years the subject has regained interest. This monograph gives an extensive overview of the basic theory of general near polygons...The first part of the book includes a discussion of the classes of dense near polygons, regular near polygons, and glued near polygons. Also valuations, one of the most important tools for classifying dense near polygons, are treated in detail. The second part of the book discusses the classification of dense near polygons with three points per line. ..The book is self-contained and almost all theorems are accompanied with proofs. Several new results are presented. Many known results occur in a more general form and the proofs are often more streamlined than their original versions. The volume is aimed at advanced graduate students and researchers in the fields of combinatorics and finite geometry..
出版日期Book 2006Latest edition
關(guān)鍵詞Combinatorics; Polygon; Quadrangle; Valuation; classification; ring theory
版次1
doihttps://doi.org/10.1007/978-3-7643-7553-9
isbn_softcover978-3-7643-7552-2
isbn_ebook978-3-7643-7553-9Series ISSN 1660-8046 Series E-ISSN 1660-8054
issn_series 1660-8046
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

書目名稱Near Polygons影響因子(影響力)




書目名稱Near Polygons影響因子(影響力)學(xué)科排名




書目名稱Near Polygons網(wǎng)絡(luò)公開度




書目名稱Near Polygons網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Near Polygons被引頻次




書目名稱Near Polygons被引頻次學(xué)科排名




書目名稱Near Polygons年度引用




書目名稱Near Polygons年度引用學(xué)科排名




書目名稱Near Polygons讀者反饋




書目名稱Near Polygons讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:15:29 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:04:42 | 只看該作者
Book 2006Latest edition-contained and almost all theorems are accompanied with proofs. Several new results are presented. Many known results occur in a more general form and the proofs are often more streamlined than their original versions. The volume is aimed at advanced graduate students and researchers in the fields of combinatorics and finite geometry..
地板
發(fā)表于 2025-3-22 08:22:22 | 只看該作者
5#
發(fā)表于 2025-3-22 08:57:45 | 只看該作者
Introduction,ngleton {.}, then we will also write d(., .) instead of d({.}, .). For every .∈ ? and every nonempty set . of vertices, we denote by Γ.(.) the set of all vertices . for which d(.)=.. If . is a singleton {.}, then we also write Γ.(.) instead of Γ.({.}).
6#
發(fā)表于 2025-3-22 15:21:46 | 只看該作者
Book 2006Latest editionaph gives an extensive overview of the basic theory of general near polygons...The first part of the book includes a discussion of the classes of dense near polygons, regular near polygons, and glued near polygons. Also valuations, one of the most important tools for classifying dense near polygons,
7#
發(fā)表于 2025-3-22 18:55:41 | 只看該作者
Introduction, vertices. A clique is called . if it is not properly contained in another clique. We will denote the distance between two vertices . and . of Γ by d(.). If . and . are two nonempty sets of vertices, then we denote by d(., .) the minimal distance between a vertex of . and a vertex of .. If . is a si
8#
發(fā)表于 2025-3-22 23:24:17 | 只看該作者
9#
發(fā)表于 2025-3-23 03:15:19 | 只看該作者
Glued near polygons,olygon(s) of diameter diam (.)+diam (.) — δ can be derived from . and .. We call these new near polygons glued near polygons of type δ. The contents of this chapter are based on the papers [29], [30], [33], [35], [38] [41], [46], [58] and [59].
10#
發(fā)表于 2025-3-23 09:22:12 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-28 14:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
辛集市| 观塘区| 昌吉市| 盘锦市| 麻栗坡县| 青田县| 永安市| 余姚市| 名山县| 静海县| 光泽县| 勐海县| 兴安盟| 泸水县| 离岛区| 呼图壁县| 获嘉县| 怀远县| 剑川县| 富川| 禹州市| 会宁县| 绥棱县| 老河口市| 凯里市| 昌平区| 临沭县| 龙州县| 师宗县| 大方县| 南充市| 博野县| 鹿邑县| 海门市| 丹阳市| 奉贤区| 南开区| 阿克| 台东市| 明光市| 招远市|