Finite set of points

Given a finite set of points in the projective plane, we use the module of Kahler differentials to investigate the configurations of these points. More precisely, depending on the values of the Hilbert function of the module of Kahler differential 3-forms, we determine whether the set of points lies on a non-singular conic, or on two different lines, or on single line.

13p vimelindagates 18-07-2022 13 2   Download

Based on the DeWitt formula the loop expansion of the effective action is easily established. Extending to the system with finite density we develop the in-medium DeWitt formula, which is the starting point for setting up loop expansion of the in-medium effective action.

9p 12120609 01-06-2020 10 1   Download

In this paper, we study the relationships between the cohomological structure of a space and that of the fixed point set of a finite dimensional pro-torus action on the space. This paper is about finite dimensional compact groups. The concept of the dimension of a compact topological group plays an essential role in transformation group theory.

9p nutifooddau 21-01-2019 30 1   Download

We give a complete description of conjugacy classes of finite subgroups of the mapping class group of the sphere with r marked points. As a corollary we obtain a description of conjugacy classes of maximal finite subgroups of the hyperelliptic mapping class group. In particular, we prove that, for a fixed genus g, there are at most five such classes.

10p danhdanh27 07-01-2019 24 1   Download

The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs.

8p vinguyentuongdanh 20-12-2018 45 0   Download

Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how to perform the corresponding minimization, and point out interesting linguistic side-effects of this operation.

6p bunmoc_1 20-04-2013 31 1   Download

The theory of Mackey functors has been developed during the last 25 years in a series of papers by various authors (J.a. Green [8], a. Dress [5], T. Yoshida [17], J. Th~venaz and P. Webb [13],[15],[14], G. Lewis [6]). It is an attempt to give a single framework for the different theories of representations of a finite group and its subgroups. The notion of Mackey functor for a group G can be essentially approached from three points of view: the first one ([8]), which I call "naive", relics on the poset of subgroups of G.

342p hotmoingay 03-01-2013 38 3   Download

Tham khảo sách 'the finite element method fifth edition volume 1', kỹ thuật - công nghệ, tự động hoá phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

708p louisxlll 20-12-2012 69 6   Download

Tham khảo sách 'theory and problems of finite mathematics schaums outlines s lipschutz 1907', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

340p ngoctu239 27-11-2012 34 1   Download

Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2011, Article ID 276859, 10 pages doi:10.

10p dauphong13 09-02-2012 66 4   Download