相关论文: A constructive method for linear extensions of Zad…
Linear extensions of posets are important objects in enumerative and algebraic combinatorics that are difficult to count in general. Families of posets like Young diagrams of straight shapes and $d$-complete posets have hook-length product…
We prove a result on the existence of linear forms of a given Diophantine type.
We give a geometric proof of Conn's linearization theorem for analytic Poisson structures, without using the fast convergence method.
We solve the fuzzy linear systems in a fuzzy number space $\mathcal{X}$, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and…
It is generally believed that the space has a nontrivial structure which is apparent on the order of the Planck length. There is a class of models of three-dimensional quantum spaces constructed using different mathematical tools. Also,…
Neo-fuzzy elements are used as nodes for an evolving cascade system. The proposed system can tune both its parameters and architecture in an online mode. It can be used for solving a wide range of Data Mining tasks (namely time series…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
This thesis develops the theory of bundle gerbes and examines a number of useful constructions in this theory. These allow us to gain a greater insight into the structure of bundle gerbes and related objects. Furthermore they naturally lead…
Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. OSF logic allows the construction of…
The paper aims to develop a framework for coalgebraic fuzzy geometric logic by adding modalities to the language of fuzzy geometric logic. Using the methods of coalgebra, the modal operators are introduced in the language of fuzzy geometric…
Gradual numbers have been introduced recently as a means of extending standard interval computation methods to fuzzy intervals. The literature treats monotonic functions of fuzzy intervals. In this paper, we combine the concepts of gradual…
Fuzzy optimization deals with the problem of determining 'optimal'solutions of an optimization problem when some of the elements that appear in the problem are not precise. In real situations it is usual to have information, in systems…
Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of…
This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.