A model of concept formation

At first we model the way an intelligence “I” constructs statements from phrases, and then how “I” interlocks these statements to form a string of statements to attain a concept. These strings of statements are called progressions. That is, starting with an initial stimulating relation between two phrases, we study how “I” forms the first statement of the progression and continues from this first statement to form the remaining statements in these progressions to construct a concept. We assume that “I” retains the progressions that it has constructed. Then we show how these retained progressions provide “I” with a platform to incrementally constructs more and more sophisticated conceptual structures. The reason for the construction of these conceptual structures is to achieve additional concepts. Choice plays a very important role in the progression and concept formation. We show that as “I” forms new concepts, it enriches its conceptual structure and makes further concepts attainable. This incremental attainment of concepts is a way in which we humans learn, and this paper studies the attainability of concepts from previously attained concepts. We also study the ability of “I” to apply its progressions and also the ability of “I” to electively manipulate its conceptual structure to achieve new concepts. Application and elective manipulation requires of “I” ingenuity and insight. We also show that as “I” attains new concepts, the conceptual structures change and circumstances arise where unanticipated conceptual discoveries are attainable. As the conceptual structure of “I” is developed, the logical and structural relationships between concepts embedded in this structure also develop. These relationships help “I” understand concepts in the context of other concepts and help “I₁” communicate to another “I₂” information and concept structures. The conceptual structures formed by “I” give rise to a directed web of statement paths which is called a convolution web. The convolution web provides “I” with the paths along which it can reason and obtain new concepts and alternative ways to attain a given concept.This paper is an extension of the ideas introduced in [1]. It is written to be self-contained and the required background is supplied as needed.     

A note on disjoint arborescences

Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds’ theorem on disjoint spanning branchings. We show a further extension of their theorem, which makes clear an essential rôle of a reachability condition played in the theorem. The right concept required for the further extension is “convexity” instead of “reachability”.     

A note on the core

This note studies an exchange economy in which there are n traders and n “kinds” of commodities. Each trader has n utility functions corresponding to n “kinds” of commodities, respectively. Thus, a multiple non-transferable utility game can be derived from this exchange economy. It is shown that a sufficient condition for non-emptiness of the core of a multiple non-transferable utility game. The result is an extension of Scarf-Billera theorem.     

Stable theories and representation over sets

In this paper we give characterizations of the stable and ?₀‐stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned classes of first‐order theories can be regarded as “not very complicated”.     

The fuzzy tychonoff theorem

Much of topology can be done in a setting where open sets have “fuzzy boundaries.” To render this precise, the paper first describes cl_∞-monoids, which are used to measure the degree of membership of points in sets. Then L- or “fuzzy” sets are defined, and suitable collections of these are called L-topological spaces. A number of examples and results for such spaces are given. Perhaps most interesting is a version of the Tychonoff theorem which gives necessary and sufficient conditions on L for all collections with given cardinality of compact L-spaces to have compact product.     

Sémantique algébrique ďun système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′_T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′_T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′_T logic and the intuitionistic and classical logics.     

The genuinely nonlinear Graetz—Nusselt ultraparabolic equation

We study a second-order quasilinear ultraparabolic equation whose matrix of the coefficients of the second derivatives is nonnegative, depends on the time and spatial variables, and can change rank in the case when it is diagonal and the coefficients of the first derivatives can be discontinuous. We prove that if the equation is a priori known to enjoy the maximum principle and satisfies the additional “genuine nonlinearity” condition then the Cauchy problem with arbitrary bounded initial data has at least one entropy solution and every uniformly bounded set of entropy solutions is relatively compact in L _loc ¹ . The proofs are based on introduction and systematic study of the kinetic formulation of the equation in question and application of the modification of the Tartar H-measures proposed by E. Yu. Panov.     

Surjectivity and invertibility properties of totally positive matrices

A new “finite section” type theorem is used to show that the members of an interesting class of bounded totally positive matrices map l_∞ onto l_∞ if and only if their range contains a vector which alternates in sign and has coordinates bounded away from zero. The class of matrices studied contains all banded totally positive matrices, and thus all infinite spline collocation matrices. Connections to related work and extension to matrices which are not sign regular are indicated.     

The construction of all locally compact extensions

The paper presents one of the ways to construct all the locally compact extensions of a given Tychonoff space T. First, there proved the “local” variant of the Stone-C?ech theorem on “completely regular” Riesz spaces X(T) of continuous bounded functions on T with no unit function, in general, but with a collection of local units. In Theorem 1 it is proved that all the functions from X(T) can be “completely regularly” extended on the largest locally compact extension β_xT. Theorem 3 states, that β_xT are presenting, in fact, all the locally compact extensions of T.     

Smooth interval maps have symbolic extensions

We prove that if X denotes the interval or the circle then every transformation T:X→X of class C ^r , where r>1 is not necessarily an integer, admits a symbolic extension, i.e., every such transformation is a topological factor of a subshift over a finite alphabet. This is done using the theory of entropy structure. For such transformations we control the entropy structure by providing an upper bound, in terms of Lyapunov exponents, of local entropy in the sense of Newhouse of an ergodic measure ν near an invariant measure μ (the antarctic theorem). This bound allows us to estimate the so-called symbolic extension entropy function on invariant measures (the main theorem), and as a consequence, to estimate the topological symbolic extension entropy; i.e., a number such that there exists a symbolic extension with topological entropy arbitrarily close to that number. This last estimate coincides, in dimension 1, with a conjecture stated by Downarowicz and Newhouse [13, Conjecture 1.2]. The passage from the antarctic theorem to the main theorem is applicable to any topological dynamical system, not only to smooth interval or circle maps.     

Fiat categorification of the symmetric inverse semigroup $$\textit{IS}_n$$ and the semigroup $$F^*_n$$Fn∗

Starting from the symmetric group \(S_n\), we construct two fiat 2-categories. One of them can be viewed as the fiat “extension” of the natural 2-category associated with the symmetric inverse semigroup (considered as an ordered semigroup with respect to the natural order). This 2-category provides a fiat categorification for the integral semigroup algebra of the symmetric inverse semigroup. The other 2-category can be viewed as the fiat “extension” of the 2-category associated with the maximal factorizable subsemigroup of the dual symmetric inverse semigroup (again, considered as an ordered semigroup with respect to the natural order). This 2-category provides a fiat categorification for the integral semigroup algebra of the maximal factorizable subsemigroup of the dual symmetric inverse semigroup.     

An extension of the Kreiss stability theorem to families of matrices of unbounded order

The Kreiss matrix theorem asserts three necessary and sufficient conditions for a family of matrices of fixed finite order to be L₂-stable: a resolvent condition (R), a triangularization condition (S) and a Hermitian norm condition (H). We extend the Kreiss theorem to families of matrices of finite but unbounded order with the restriction that the degrees of the minimal polynomials of all matrices in the family are less than a fixed constant. For such matrix families, we show that (R) and (H) remain necessary and sufficient for L₂-stability, while (S) must be replaced by a somewhat stronger “block triangularization” condition (S′). This extended Kreiss theorem permits a corresponding extension of the Buchanan stability theorem.     

Conditions at infinity for boltzmann's equation.

We consider here realistic conditions at infinity for solutions of the Boltzmann's equation, such as a pure Maxwellian equilibrium at infinity possibly with suitable boundary conditions on an exterior domain, different Maxwellian equilibria at +∞ and -;∞ in a tube-like situation and more generally conditions at infinity obtained from a fixed solution. In order to adapt the recent global existence and compactness results due to R.J. DiPerna and the author, we have to obtain some local a priori estimates on the mass, kinetic energy and entropy. And this is precisely what we achieve here by two different and new methods. The first one consists in using the relative entropy of solutions with respect to a fixed, possibly local, Maxwellian. This method allows to treat general collision kernels with angular cut-off and some of the conditions at infinity mentioned above. The second method is based upon a L¹ estimate and an extension of the entropy identity which uses a truncated H-functional. This method requires a “uniform integrability” condition on the collision kernel but allows to consider the most general conditions at infinity.     

连续型随机向量联合熵的离散方差分离估计

提出了一种"离散方差分离"法,用于连续型随机向量联合熵的估计.方法分为"方差分离"和"离散"两个步骤.前者通过分离"标准熵"与"标准差对数和"来避免维数灾害;后者通过各分量的"最佳分割数"来离散连续型随机向量,从而避开了联合密度估计.仿真实验表明:该方法以很低的计算复杂度,准确地逼近了理论值.     

T0-SEPARATION IN TOPOLOGICAL CATEGORIES

R.-E. Hoffmann [5,6] has introduced the notion of an (E,M)-universally topological functor, which provides a categorical characterization of the T₀-separation axiom of general topology. In this paper, we characterise these functors in terms of the unique extension of structure functors defined on the subcategory of “separated” objects (of the domain category). This, in turn, leads to a solution of some problems due to G.C.L. Brümmer [1,2]. Other results include a generalization of L. Skula's characterization of the bireflective subcategories of Top [10].     

Single valued neutrosophic cross-entropy for multicriteria decision making problems

A single valued neutrosophic set (SVNS) is an instance of a neutrosophic set, which give us an additional possibility to represent uncertainty, imprecise, incomplete, and inconsistent information which exist in real world. It would be more suitable to apply indeterminate information and inconsistent information measures. In this paper, the cross entropy of SVNSs, called single valued neutrosophic cross entropy, is proposed as an extension of the cross entropy of fuzzy sets. Then, a multicriteria decision-making method based on the proposed single valued neutrosophic cross entropy is established in which criteria values for alternatives are SVNSs. In decision making process, we utilize the single-valued neutrosophic weighted cross entropy between the ideal alternative and an alternative to rank the alternatives corresponding to the cross entropy values and to select the most desirable one(s). Finally, a practical example of the choosing problem of suppliers is provided to illustrate the application of the developed approach.     

Cyclic Tableaux and Symmetric Functions

We introduce the notion of cyclic tableaux and develop involutions for Waring's formulas expressing the power sum symmetric function p_n in terms of the elementary symmetric function e_n and the homogeneous symmetric function h_n. The coefficients appearing in Waring's formulas are shown to be a cyclic analog of the multinomial coefficients, a fact that seems to have been neglected before. Our involutions also spell out the duality between these two forms of Waring's formulas, which turns out to be exactly the “duality between sets and multisets.” We also present an involution for permutations in cycle notation, leading to probably the simplest combinatorial interpretation of the Möbius function of the partition lattice and a purely combinatorial treatment of the fundamental theorem on symmetric functions. This paper is motivated by Chebyshev polynomials in connection with Waring's formula in two variables.     

Quasi-Baer Rings with Essential Prime Radicals

A ring R is called “quasi-Baer” if the right annihilator of every right ideal is generated, as a right ideal, by an idempotent. It can be seen that a quasi-Baer ring cannot be a right essential extension of a nilpotent right ideal. Birkenmeier asked: Does there exist a quasi-Baer ring which is a right essential extension of its prime radical? We answer this question in the affirmative. Moreover, we provide an example of a quasi-Baer ring in which the right essentiality of the prime radical does not imply the left essentiality of the prime radical.     

Symbole de Newton. Symbole de Jacobi-Carlitz

First of all we define the “Newton symbol” of two polynomials with coefficients in a commutative ring. The “Artinian symbol” of two polynomials of F₂[t] is then defined by analogy with the quadratic residue symbol. We prove that the Artinian symbol satisfies an “Euler's criterion”, and we define a “Jacobi-Carlitz symbol” in terms of the Newton symbol.     

List multicolorings of graphs with measurable sets

In an ordinary list multicoloring of a graph, the vertices are “colored” with subsets of pre‐assigned finite sets (called “lists”) in such a way that adjacent vertices are colored with disjoint sets. Here we consider the analog of such colorings in which the lists are measurable sets from an arbitrary atomless, semifinite measure space, and the color sets are to have prescribed measures rather than prescribed cardinalities. We adapt a proof technique of Bollobás and Varopoulos to prove an analog of one of the major theorems about ordinary list multicolorings, a generalization and extension of Hall's marriage theorem, due to Cropper, Gyárfás, and Lehel. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 179–193, 2007