A new Bartholdi zeta function of a digraph II

We introduce a new type of the Bartholdi zeta function of a digraph D. Furthermore, we define a new type of the Bartholdi L-function of D, and give a determinant expression of it. We show that this L-function of D is equal to the L-function of D defined in [H. Mizuno, I. Sato, A new Bartholdi zeta function of a digraph, Linear Algebra Appl. 423 (2007) 498-511]. As a corollary, we obtain a decomposition formula for a new type of the Bartholdi zeta function of a group covering of D by new Bartholdi L-functions of D.     

A class of algebraic-trigonometric blended splines

This paper presents a new kind of algebraic-trigonometric blended spline curve, called xyB curves, generated over the space {1,t,sint,cost,sin²t,sin³t,cos³t}. The new curves not only inherit most properties of usual cubic B-spline curves in polynomial space, but also enjoy some other advantageous properties for modeling. For given control points, the shape of the new curves can be adjusted by using the parameters x and y. When the control points and the parameters are chosen appropriately, the new curves can represent some conics and transcendental curves. In addition, we present methods of constructing an interpolation xyB-spline curve and an xyB-spline curve which is tangent to the given control polygon. The generation of tensor product surfaces by these new spline curves is straightforward. Many properties of the curves can be easily extended to the surfaces. The new surfaces can exactly represent the rotation surfaces as well as the surfaces with elliptical or circular sections.     

Locating two obnoxious facilities using the weighted maximin criterion

Given are a finite set of points P and a compact polygonal set S in R². The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.     

Properties of an h-Bernstein-like basis and curves

Blossoming is a useful technique to study bases and curve representations in computer-aided geometric design. Recently Simeonov et al. (Comput Aided Geom Des 28:549–565, 2011) have used a blossom generalization, namely the h-blossom, to derive new results about the h-Bernstein basis and h-Bézier curves that have previously been studied in approximation theory and computer-aided geometric design. This paper introduces a basis related to the h-Bernstein basis. There is a close relationship between this new basis and the h-Bernstein basis, between the new basis and the h-blossom, and between the new basis and “progressive” curves. This paper explores these relationships and uses them to derive properties both of the new basis itself, and of curves represented in terms of the new basis.     

A new Leray formula for smooth functions on bounded domains in C n

By means of a new technique of integral representations in C ⁿ given by the authors, we establish a new abstract formula with a vector function W for smooth functions on bounded domains in C ⁿ , which is different from the well-known Leray formula. This new formula eliminates the term that contains the parameter A from the classical Leray formula, and especially on some domains the uniform estimates for the $\bar \partial - equation$ are very simple. From the new Leray formula, we can obtain correspondingly many new formulas for smooth functions on many domains in C ⁿ , which are different from the classical ones, when we properly select the vector function W.     

On 1-Systems of Q(6, q), q Even

In this paper, a method is developed to study locally hermitian 1-systems of Q(6, q), q even, by associating a kind of flock in PG(4, q) to them. This method is applied to a known locally hermitian 1-system of Q(6, 2^2e ), which was discovered by Offer as a spread of the hexagon H(2^2e ). The results concerning this spread appear to be suitable for generalization and enable us to find new classes of 1-systems of Q(6, q), q even. We also prove that a locally hermitian 1-system of Q(6, q), q even, which is not contained in a 5-dimensional subspace, is semi-classical if and only if it belongs to the new classes we describe. Finally, from the new classes of 1-systems arise new classes of semipartial geometries.     

Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations

Combinatorial designs have been widely used, in the construction of self-dual codes. Recently, new methods of constructing self-dual codes are established using orthogonal designs (ODs), generalized orthogonal designs (GODs), a set of four sequences and Diophantine equations over GF(p). These methods had led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we used some methods to construct self-orthogonal and self dual codes over GF(p), for some primes p. The construction is achieved by using some special kinds of combinatorial designs like orthogonal designs and GODs. Moreover, we combine eight circulant matrices, a system of Diophantine equations over GF(p), and a recently discovered array to obtain a new construction method. Using this method new self-dual and self-orthogonal codes are obtained. Specifically, we obtain new self-dual codes [32,16,12] over GF(11) and GF(13) which improve the previously known distances.     

On the leastK-th power non-residue

LetC _k (p) denote the group of thek-th powers (modp)p a prime with (k, p ?1)>1. A new elementary result for the leastk-th power non-residue is given and the result is applied to finding a new elementary bound for the maximum number of consecutuve integers in any coset ofC _k (p).     

Braids and partial permutations

We study the inverse braid monoid IBn introduced by Easdown and Lavers in 2004. We completely describe the factorizable structure of IBn and use this to give a new proof of the Easdown-Lavers presentation; we also derive several new presentations, each of which gives rise to a new presentation of the symmetric inverse monoid. We then define and study the pure inverse braid monoid IPn which is related to IBn in the same way that the pure braid group is related to the braid group.     

A new method for computing the matrix exponential operation based on vector valued rational approximations

In this paper a new method for computing the action of the matrix exponential on a vector e^Atb, where A is a complex matrix and t is a positive real number, is proposed. Our approach is based on vector valued rational approximation where the approximants are determined by the denominator polynomials whose coefficients are obtained by solving an inexpensive linear least-squares problem. No matrix multiplications or divisions but matrix-vector products are required in the whole process. A technique of scaling and recurrence enables our method to be more effective when the problem is for fixed A,b and many values of t. We also give a backward error analysis in exact arithmetic for the truncation errors to derive our new algorithm. Preliminary numerical results illustrate that the new algorithm performs well.     

Perturbation and Interpolation Theorems for the H ∞-Calculus with Applications to Differential Operators

We prove comparison theorems for the H ^∞-calculus that allow to transfer the property of having a bounded H ^∞-calculus from one sectorial operator to another. The basic technical ingredient are suitable square function estimates. These comparison results provide a new approach to perturbation theorems for the H ^∞-calculus in a variety of situations suitable for applications. Our square function estimates also give rise to a new interpolation method, the Rademacher interpolation. We show that a bounded H ^∞-calculus is characterized by interpolation of the domains of fractional powers with respect to Rademacher interpolation. This leads to comparison and perturbation results for operators defined in interpolation scales such as the L _p -scale. We apply the results to give new proofs on the H ^∞-calculus for elliptic differential operators, including Schrödinger operators and perturbed boundary conditions. As new results we prove that elliptic boundary value problems with bounded uniformly coefficients have a bounded H ^∞-calculus in certain Sobolev spaces and that the Stokes operator on bounded domains Ω with ?Ω ∈ C ^1,1 has a bounded H ^∞-calculus in the Helmholtz scale L _p,σ (Ω), p ∈ (1,∞).     

A tower with non-Galois steps which attains the Drinfeld-Vladut bound

We introduce a new tower of function fields over a finite field of square cardinality, which attains the Drinfeld-Vladut bound. One new feature of this new tower is that it is constructed with non-Galois steps; i.e., with non-Galois function field extensions. The exact value of the genus g(F_n) is also given (see Lemma 4).     

A novel cubically convergent iterative method for computing complex roots of nonlinear equations

A fast and simple iterative method with cubic convergent is proposed for the determination of the real and complex roots of any function F(x) = 0. The idea is based upon passing a defined function G(x) tangent to F(x) at an arbitrary starting point. Choosing G(x) in the form of x^k or k^x, where k is obtained for the best correlation with the function F(x), gives an added freedom, which in contrast to all existing methods, accelerates the convergence. Also, this new method can find complex roots just by a real initial guess. This is in contrast to many other methods like the famous Newton method that needs complex initial guesses for finding complex roots. The proposed method is compared to some new and famous methods like Newton method and a modern solver that is fsolve command in MATLAB. The results show the effectiveness and robustness of this new method as compared to other methods.     

Locally singular hyperplanes in thick dual polar spaces of rank 4

We study (i-)locally singular hyperplanes in a thick dual polar space Δ of rank n. If Δ is not of type DQ(2n,K), then we will show that every locally singular hyperplane of Δ is singular. We will describe a new type of hyperplane in DQ(8,K) and show that every locally singular hyperplane of DQ(8,K) is either singular, the extension of a hexagonal hyperplane in a hex or of the new type.     

New types of generalized closed sets in bitopological spaces

In this paper, we introduce a new type of closed sets in bitopological space (X, τ₁, τ₂), used it to construct new types of normality, and introduce new forms of continuous function between bitopological spaces. Finally, we proved that the our new normality properties are preserved under some types of continuous functions between bitopological spaces.     

Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

In this paper, we investigate new lower bounds for the P|r _j ,q _j |C _max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP -hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.     

Similarity invariants for matrices over a commutative Artinian chain ring

Suppose that R is a commutative Artinian chain ring, A is an m × m matrix over R, and S is a discrete valuation ring such that R is a homomorphic image of S. We consider m ideals in the polynomial ring over S that are similarity invariants for matrices over R, i.e., these ideals coincide for similar matrices. It is shown that the new invariants are stronger than the Fitting invariants, and that new invariants solve the similarity problem for 2 × 2 matrices over R.     

On a new geometric constant related to the von Neumann-Jordan constant

The von Neumann-Jordan constant CNJ(X) is computed for X being ?₂−?₁ and ?_∞−?₁ space by introducing a new geometric constant γX(t). These partly give an answer to an open question posed by Kato et al. Some basic properties of this new coefficient are investigated. Moreover, we obtain a new class of Banach spaces with uniform normal structure.     

Sequentially two-leveled egalitarianism for TU games: Characterization and application

A new linear value for cooperative transferable utility games is introduced. The recursive definition of the new value for an n-person game involves a sequential process performed at n − 1 stages, applying the value to subgames with a certain size k,1 ? k < n, combining with the rule of two-leveled egalitarianism (additive normalization) in order to guarantee the efficiency property for the new value, sequentially two-leveled egalitarianism, shortly S₂EG value, applied to subgames of size k + 1. The new value will be characterized in various ways. The S₂EG value differs from the Shapley value since, besides efficiency, linearity, and symmetry, it verifies an additional property with respect to so-called scale-dummy player (replacing dummy player property). Consequently, the S₂EG value of a game may be determined as the solidarity value of the per-capita game (incorporating the proportional rule due to different levels of efficiency). Various potential representations of the new value are established. In the application to a land corn production economy, it yields allocations, in which the landlord’s interest coincides with striving for a maximum production level. For economies with the linear production function, not only the unique landlord but also all the workers have incentives to increase the scale of the economy.     

A new high accuracy locally one-dimensional scheme for the wave equation

In this paper, a new locally one-dimensional (LOD) scheme with error of O(Δt⁴+h⁴) for the two-dimensional wave equation is presented. The new scheme is four layer in time and three layer in space. One main advantage of the new method is that only tridiagonal systems of linear algebraic equations have to be solved at each time step. The stability and dispersion analysis of the new scheme are given. The computations of the initial and boundary conditions for the two intermediate time layers are explicitly constructed, which makes the scheme suitable for performing practical simulation in wave propagation modeling. Furthermore, a comparison of our new scheme and the traditional finite difference scheme is given, which shows the superiority of our new method.