Characterizations of PG(n−1,q)\PG(k−1,q) by Numerical and Polynomial Invariants

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs determined by polynomial invariants

Many polynomials have been de'ned associated to graphs, like the characteristic, matchings, chromatic and Tutte polynomials. Besides their intrinsic interest, they encode useful combinatorial information about the given graph. It is natural then to ask to what extent any of these polynomials determines a graph and, in particular, whether one can 'nd graphs that can be uniquely determined by a g...

متن کامل

Polynomial Invariants by Linear Algebra

We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guara...

متن کامل

Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants

Semidefinite programming (SDP) solvers are increasingly used as primitives in many program verification tasks to synthesize and verify polynomial invariants for a variety of systems including programs, hybrid systems and stochastic models. On one hand, they provide a tractable alternative to reasoning about semi-algebraic constraints. However, the results are often unreliable due to “numerical ...

متن کامل

Polynomial Invariants of Graphs

We define two polynomials f(G) and /*(G) for a graph G by a recursive formula with respect to deformation of graphs. Analyzing their various properties, we shall discuss when two graphs have the same polynomials. Introduction. Our graphs are finite, undirected ones with or without self-loops and multiple edges. As elementary deformations of graphs, we have the deletion and the contraction of ed...

متن کامل

NUMERICAL SOLUTION OF ONE-DIMENSIONAL HEAT AND WAVE EQUATION BY NON-POLYNOMIAL QUINTIC SPLINE

This paper present a novel numerical algorithm for the linear one-dimensional heat and wave equation. In this method, a nite dierenceapproach had been used to discrete the time derivative while cubic spline isapplied as an interpolation function in the space dimension. We discuss theaccuracy of the method by expanding the equation based on Taylor series andminimize the error. The proposed metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2002

ISSN: 0196-8858

DOI: 10.1006/aama.2001.0786