平面上一类自相似集的共形维数

本文证明了平面上一类自相似集的共形维数为1.此外还证明了这些自相似集与任何Hausdorff维数为1的度量空间都不是拟对称等价的.这表明,对于这些自相似集而言,共形维数定义中的下确界不能达到.     

Salem sets in local fields, the Fourier restriction phenomenon and the Hausdorff-Young inequality

We establish the existence of Salem sets in the ring of integers of any local field and study the Fourier restriction phenomenon on such sets. Optimal extension of the Hausdorff-Young inequality, initially attained for the torus by G. Mockenhaupt and W. Ricker, is also established in the local field setting.     

Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices

Conditions imposed on the matrices of the Quadratic Assignment Problem (QAP) are derived such that an optimum of the QAP is attained on a given permutation. These conditions describe four new sets of matrices, which, in the general case, are not anti-Monge and Toeplitz matrices that were used for most of the known well solvable special cases of the QAP.     

Solution concepts in vector optimization: a fresh look at an old story

Over the past decades various solution concepts for vector optimization problems have been established and used: among them are efficient, weakly efficient and properly efficient solutions. In contrast to the classical approach, we define a solution to be a set of efficient solutions on which the infimum of the objective function with respect to an appropriate complete lattice (the space of self-infimal sets) is attained. The set of weakly efficient solutions is not considered to be a solution, but weak efficiency is essential in the construction of the complete lattice. In this way, two classic concepts are involved in a common approach. Several different notions of semicontinuity are compared. Using the space of self-infimal sets, we can show that various originally different concepts coincide. A Weierstrass existence result is proved for our solution concept. A slight relaxation of the solution concept yields a relationship to properly efficient solutions.     

An Interval Counterexample on Topological Sequence Entropy

We provide an example showing that, in general, the topological sequence entropy of a continuous interval map cannot be attained on the set of non-wandering points. This proves that there is no connection between the topological sequence entropy of an interval map and its behavior on sets of special dynamical meaning.     

The conjugacy vector of ap-group of maximal class

We find the conjugacy vector, i.e., we determine the number of conjugacy classes which compose the sets of the elements with centralizers of equal order, for several general families ofp-groups of maximal class which include those of order up top ⁹. As a consequence, we obtain the number of conjugacy classes,r(G), for the groups in these families. Also, we provide upper and lower bounds forr(G) and characterize when they are attained. Examples are given showing that the bounds are actually attained. This work has been supported by DGICYT grant PB91-0446 and by the University of the Basque Country.     

Finiteness conjecture and subdivision

The finiteness conjecture by J.C. Lagarias and Y. Wang states that the joint spectral radius of a finite set of square matrices is attained on some finite product of such matrices. This conjecture is known to be false in general. Nevertheless, we show that this conjecture is true for a big class of finite sets of square matrices used for the smoothness analysis of scalar univariate subdivision schemes with finite masks.     

A level set approach for the solution of a state-constrained optimal control problem

Summary. State constrained optimal control problems for linear elliptic partial differential equations are considered. The corresponding first order optimality conditions in primal-dual form are analyzed and linked to a free boundary problem resulting in a novel algorithmic approach with the boundary (interface) between the active and inactive sets as optimization variable. The new algorithm is based on the level set methodology. The speed function involved in the level set equation for propagating the interface is computed by utilizing techniques from shape optimization. Encouraging numerical results attained by the new algorithm are reported on.Mathematics Subject Classification (1991): 35R35, 49K20, 49Q10, 65K10Revised version received March 19, 2003     

Concentration of the first eigenfunction for a second order elliptic operator

We study the semi-classical limits of the first eigenfunction of a positive second order operator on a compact Riemannian manifold when the diffusion constant ε goes to zero. We assume that the first order term is given by a vector field b, whose recurrent components are either hyperbolic points or cycles or two dimensional torii. The limits of the normalized eigenfunctions concentrate on the recurrent sets of maximal dimension where the topological pressure [Y. Kifer, Principal eigenvalues, topological pressure and stochastic stability of equilibrium states, Israel J. Math. 70 (1990) (1) 1–47] is attained. On the cycles and torii, the limit measures are absolutely continuous with respect to the invariant probability measure on these sets. We have determined these limit measures, using a blow-up analysis. To cite this article: D. Holcman, I. Kupka, C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

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. 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. We explored the structural aspects of Tutte sets in another paper. Here, we consider the algorithmic complexity of finding Tutte sets in a graph. We first give two polynomial algorithms for finding a maximal Tutte set. We then consider the complexity of finding a maximum Tutte set, and show it is NP-hard for general graphs, as well as for several interesting restricted classes such as planar graphs. By contrast, we show we can find maximum Tutte sets in polynomial time for graphs of level 0 or 1, elementary graphs, and 1-tough graphs.     

Solving the linear multiple choice knapsack problem with two objectives: profit and equity

In this paper, we study an extension of the Linear Multiple Choice Knapsack (LMCK) Problem that considers two objectives. The problem can be used to find the optimal allocation of an available resource to a group of disjoint sets of activities, while also ensuring that a certain balance on the resource amounts allocated to the activity sets is attained. The first objective maximizes the profit incurred by the implementation of the considered activities. The second objective minimizes the maximum difference between the resource amounts allocated to any two sets of activities. We present the mathematical formulation and explore the fundamental properties of the problem. Based on these properties, we develop an efficient algorithm that obtains the entire nondominated frontier. The algorithm is more efficient than the application of the general theory of multiple objective linear programming (MOLP), although there is a close underlying relationship between the two. We present theoretical findings which provide insight into the behavior of the algorithm, and report computational results which demonstrate its efficiency for randomly generated problems. Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.     

A penalty-interior-point algorithm for nonlinear constrained optimization

Penalty and interior-point methods for nonlinear optimization problems have enjoyed great successes for decades. Penalty methods have proved to be effective for a variety of problem classes due to their regularization effects on the constraints. They have also been shown to allow for rapid infeasibility detection. Interior-point methods have become the workhorse in large-scale optimization due to their Newton-like qualities, both in terms of their scalability and convergence behavior. Each of these two strategies, however, have certain disadvantages that make their use either impractical or inefficient for certain classes of problems. The goal of this paper is to present a penalty-interior-point method that possesses the advantages of penalty and interior-point techniques, but does not suffer from their disadvantages. Numerous attempts have been made along these lines in recent years, each with varying degrees of success. The novel feature of the algorithm in this paper is that our focus is not only on the formulation of the penalty-interior-point subproblem itself, but on the design of updates for the penalty and interior-point parameters. The updates we propose are designed so that rapid convergence to a solution of the nonlinear optimization problem or an infeasible stationary point is attained. We motivate the convergence properties of our algorithm and illustrate its practical performance on large sets of problems, including sets of problems that exhibit degeneracy or are infeasible.     

Beurling dimension and self-similar measures

In this paper the authors study the Beurling dimension of Bessel sets and frame spectra of some self-similar measures on ${\mathbb{R}}^d$ and obtain their exact upper bound of the dimensions, which is the same given by Dutkay et al. (2011) [8]. The upper bound is attained in usual cases and some examples are given to explain our theory.     

Optimal scheduling policies in time sharing service systems

We consider optimal scheduling problems in a TSSS (Time Sharing Service System), i.e., a tandem queueing network consisting of multiple service stations, all of which are served by a single server. In each station, a customer can receive service time up to the prescribed station dependent upper bound, but he must proceed to the next station in order to receive further service. After the total amount of the received services reaches his service requirement, he departs from the network. The optimal policy for this system minimizes the long-run average expected waiting cost per unit of time over the infinite planning horizon. It is first shown that, if the distribution of customer's service requirement is DMRL (Decreasing Mean Residual Life), the policy of giving the highest priority to the customer with the most attained service time is optimal under a set of some appropriate conditions. This implies that any policy without interruptions and preemptions of services is optimal. If the service requirement is DFR (Decreasing Failure Rate), on the other hand, it is shown that the policy of giving the highest priority to the customer with the least attained service time, i.e., the so-called LAST (Least Attained Service Time first) is optimal under another set of some appropriate conditions. These results can be generalized to the case in which there exist multiple classes of customers, but each class satisfies one of the above sets of conditions.     

Stochastic bounds for attained levels

Asymptotic inequalities are obtained for the level attained by any test statistic in a given hypothesis testing problem. The bounds so obtained are themselves random. The inequalities subsume previous results by Bahadur and others about the asymptotic behavior of attained levels. Various remifications of the inequalities are discussed, including a notion of stochastic deficiency.     

Sharp bounds on the volume fractions of two materials in a two-dimensional body from electrical boundary measurements: the translation method

We deal with the problem of estimating the volume of inclusions using a small number of boundary measurements in electrical impedance tomography. We derive upper and lower bounds on the volume fractions of inclusions, or more generally two phase mixtures, using two boundary measurements in two dimensions. These bounds are optimal in the sense that they are attained by certain configurations with some boundary data. We derive the bounds using the translation method which uses classical variational principles with a null Lagrangian. We then obtain necessary conditions for the bounds to be attained and prove that these bounds are attained by inclusions inside which the field is uniform. When special boundary conditions are imposed the bounds reduce to those obtained by Milton and these in turn are shown here to reduce to those of Capdeboscq–Vogelius in the limit when the volume fraction tends to zero. The bounds of this article, and those of Milton, work for inclusions of arbitrary volume fractions. We then perform some numerical experiments to demonstrate how good these bounds are.     

Interval-valued level cut sets of fuzzy set

The connections between Zadeh fuzzy set and three-valued fuzzy set are established in this paper. The concepts of interval-valued level cut sets on Zadeh fuzzy set are presented and new decomposition theorems and representation theorems of Zadeh fuzzy set are established based on new cut sets. Firstly, four interval-valued level cut sets on Zadeh fuzzy set are defined as three-valued fuzzy sets and it is shown that the interval-valued level cut sets of Zadeh fuzzy set are generalizations of normal cut sets on Zadeh fuzzy set, and have the same properties as those of normal cut sets of Zadeh fuzzy set. Secondly, the new decomposition theorems are established based on these new cut sets. It is pointed out that each kind of interval-valued level cut sets corresponds to two decomposition theorems. Thus eight decomposition theorems are obtained. Finally, the definitions of three-valued inverse order nested sets and three-valued order nested sets are presented with eight representation theorems based on new nested sets.     

On Fatou sets concerning Yang-Lee theory

The sets of the points corresponding to the complex phases of the Potts model on the diamond hierarchcal lattice are studied. These sets are the Fatou sets of a family of rational mappings. The topological structures of these sets are described completely.