Polytope bounds on multivariate value sets

We improve the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.     

On value sets of polynomials over a field

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+∞ otherwise. Let A₁,…,A_n be finite nonempty subsets of F, and let

with k{1,2,3,…}, a₁,…,a_nF{0} and degg<k. We show that

When kn and |A_i|i for i=1,…,n, we also have

consequently, if nk then for any finite subset A of F we have

In the case n>k, we propose a further conjecture which extends the Erdős–Heilbronn conjecture in a new direction.     

Aitken–Neville sets, principal lattices and divided differences

In this paper we study multivariate polynomial interpolation on Aitken–Neville sets by relating them to generalized principal lattices. We express their associated divided differences in terms of spline integrals.     

On mean approximation by polynomials with gaps on Caratheodory sets

The paper presents some new results on the possibility of approximation by polynomials with gaps. The approximations are done in the norm of the space L _p , 1 ≤ p < + ∞, on the Caratheodory sets in the complex plane. The lacunary versions of some results by Farell—Markushevich, S. Sinanian, A. L. Shahinian are obtained (Theorems 1, 3, 5). Similar approximations by the real parts of lacunary polynomials are given (Theorems 2, 4, 6). Dedicated to the memory of academician S. N. Mergelyan     

Almost semirecursive sets

LetA be a subset of , and leta∉A. The setA is said to be almost semirecursive, if there is a two-place general recursive functionf such thatf(x, y)ε{x, y, a}∧({x, y}⊆A⇌f(x, y)εA) for all . Among other facts, it is proved that ifA and are almost semirecursive sets, thenA is a semirecursive set, and that there exists a wsr^*-set that is neither a wsr-nor an almost semirecursive set. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 188–193, August, 1999.     

Some formal relationships among soft sets,fuzzy sets,and their extensions

We prove that every hesitant fuzzy set on a set E can be considered either a soft set over the universe $[0,1]$ or a soft set over the universe E. Concerning converse relationships, for denumerable universes we prove that any soft set can be considered even a fuzzy set. Relatedly, we demonstrate that every hesitant fuzzy soft set can be identified with a soft set, thus a formal coincidence of both notions is brought to light. Coupled with known relationships, our results prove that interval type-2 fuzzy sets and interval-valued fuzzy sets can be considered as soft sets over the universe $[0,1]$. Altogether we contribute to a more complete understanding of the relationships among various theories that capture vagueness and imprecision.     

Remez-type inequality on sets with cusps

A Remez-type inequality is proved for a large family of sets with cusps in R^N${\mathbb{R}}^N$, including compact, fat and semialgebraic (or subanalytic) sets.     

Locating and paired-dominating sets in graphs

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.     

Bregman distances without coercive condition: suns,Chebyshev sets and Klee sets

ABSTRACT

In a real Banach space X, we introduce for a non-empty set C in X the notion of suns in the sense of Bregman distances and show that C is such a sun if and only if C is convex. Also, we give some necessary and sufficient conditions for a compact set to be the Klee set, extending corresponding results on the Euclidean space.     

Piecewise parametric polynomial fuzzy sets

We present a scheme for tractable parametric representation of fuzzy set membership functions based on the use of a recursive monotonic hierarchy that yields different polynomial functions with different orders. Polynomials of the first order were found to be simple bivalent sets, while the second order polynomials represent the typical saw shape triangles. Higher order polynomials present more diverse membership shapes. The approach demonstrates an enhanced method to manage and fit the profile of membership functions through the access to the polynomials order, the number and the multiplicity of anchor points as wells as the uniformity and periodicity features used in the approach. These parameters provide an interesting means to assist in fitting a fuzzy controller according to system requirements. Besides, the polynomial fuzzy sets have tractable characteristics concerning the continuity and differentiability that depend on the order of the polynomials. Higher order polynomials can be differentiated as many times as the order of the polynomial less the multiplicity of the anchor points. An algorithmic optimization approach using the steepest descent method is introduced for fuzzy controller tuning. It was shown that the controller can be optimized to model a certain output within small number of iterations and very small error margins. The mathematics generated by the approach is consistent and can be simply generalized to standard applications. The recursive propagation was noticed for its clarity and ease of calculations. Further, the degree of association between the sets is not limited to the neighbors as in traditional applications; instead, it may extend beyond.Such approach can be useful in dynamic fuzzy sets for adaptive modeling in view of the fact that the shape parameters can be easily altered to get different profiles while keeping the math unchanged. Hypothetically, any shape of membership functions under the partition of unity constraint can be produced. The significance of the mentioned characteristics of such modeling can be observed in the field of combinatorial and continuous parameter optimization, automated tuning, optimal fuzzy control, fuzzy-neural control, membership function fitting, adaptive modeling, and many other fields that require customized as well as standard fuzzy membership functions. Experimental work of different scenarios with diverse fuzzy rules and polynomial sets has been conducted to verify and validate our results.     

Some remarks on good sets

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.     

Topology vs generalized rough sets

This paper investigates the relationship between topology and generalized rough sets induced by binary relations. Some known results regarding the relation based rough sets are reviewed, and some new results are given. Particularly, the relationship between different topologies corresponding to the same rough set model is examined. These generalized rough sets are induced by inverse serial relations, reflexive relations and pre-order relations, respectively. We point that inverse serial relations are weakest relations which can induce topological spaces, and that different relation based generalized rough set models will induce different topological spaces. We proved that two known topologies corresponding to reflexive relation based rough set model given recently are different, and gave a condition under which the both are the same topology.     

Witness sets of projections

Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets to compute the projection of an algebraic set. The ideas described in this article apply to computing the image of an algebraic set under any linear map.     

Involutive characteristic sets of algebraic partial differential equation systems

This paper presents an algorithm to reduce a nonlinear algebraic partial differential equation system into the involutive characteristic set with respect to an involutive prolongation direction, which covers the existing algorithms based on Riquier method, Thomas method, and Pommaret method. It also provides new algorithms for computing involutive characteristic sets due to the existence of new involutive directions. Experiments show that these new algorithms may be used to significantly reduce the computational steps in Wu-Ritt's characteristic set method for algebraic partial differential equations.     

Tutte sets in graphs I: Maximal tutte sets and D‐graphs

A well‐known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in terms of what is usually called the deficiency of G. A subset X of V(G) for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this article, we study the structural aspects of maximal Tutte sets in a graph G. Towards this end, we introduce a related graph D(G). We first show that the maximal Tutte sets in G are precisely the maximal independent sets in its D‐graph D(G), and then continue with the study of D‐graphs in their own right, and of iterated D‐graphs. We show that G is isomorphic to a spanning subgraph of D(G), and characterize the graphs for which G?D(G) and for which D(G)?D²(G). Surprisingly, it turns out that for every graph G with a perfect matching, D³(G)?D²(G). Finally, we characterize bipartite D‐graphs and comment on the problem of characterizing D‐graphs in general. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 343–358, 2007     

Quasisymmetrically minimal uniform Cantor sets

The uniform Cantor set E(n,c) of Hausdorff dimension 1, defined by a bounded sequence n of positive integers and a gap sequence c, is shown to be minimal for 1-dimensional quasisymmetric maps.