Relations between the Clausen and Kazhdan-Lusztig representations of the symmetric group

We use Kazhdan-Lusztig polynomials and subspaces of the polynomial ring C[x_1,1,…,x_n,n] to give a new construction of the Kazhdan-Lusztig representations of S_n. This construction produces exactly the same modules as those which Clausen constructed using a different basis in [M. Clausen, Multivariate polynomials, standard tableaux, and representations of symmetric groups, J. Symbolic Comput. (11), 5-6 (1991) 483-522. Invariant-theoretic algorithms in geometry (Minneapolis, MN, 1987)], and does not employ the Kazhdan-Lusztig preorders. We show that the two resulting matrix representations are related by a unitriangular transition matrix. This provides a C[x_1,1,…,x_n,n]-analog of results due to Garsia and McLarnan, and McDonough and Pallikaros, who related the Kazhdan-Lusztig representations to Young’s natural representations.     

On the Ni(x) integral function and its application to the Airy’s non-homogeneous equation

In this article, we discuss a recently introduced function, Ni(x), to which we will refer as the Nield-Kuznetsov function. This function is attractive in the solution of inhomogeneous Airy’s equation. We derive and document some elementary properties of this function and outline its application to Airy’s equation subject to initial conditions. We introduce another function, Ki(x), that arises in connection with Ni(x) when solving Airy’s equation with a variable forcing function. In Appendix A, we derive a number of properties of both Ni(x) and Ki(x), their integral representation, ascending and asymptotic series representations. We develop iterative formulae for computing all derivatives of these functions, and formulae for computing the values of the derivatives at x = 0. An interesting finding is the type of differential equations Ni(x) satisfies. In particular, it poses itself as a solution to Langer’s comparison equation.     

Residual income and value creation: An investigation into the lost-capital paradigm

This paper presents a new way of measuring residual income, originally introduced by Magni (2000a,b,c, 2001a,b, 2003). Contrary to the standard residual income, the capital charge is equal to the capital lost by investors multiplied by the cost of capital. The lost capital may be viewed as (a) the foregone capital, (b) the capital implicitly infused into the business, (c) the outstanding capital of a shadow project, (d) the claimholders’ credit. Relations of the lost capital with book values and market values are studied, as well as relations of the lost capital residual income with the classical standard paradigm; many appealing properties are derived, among which an aggregation property. Different concepts and results, provided by different authors in such different fields as economic theory, management accounting and corporate finance, are considered: O’Hanlon and Peasnell’s (2002) unrecovered capital and Excess Value Created; Ohlson’s (2005) Abnormal Earnings Growth; O’Byrne’s (1997) EVA improvement; Miller and Modigliani’s (1961) investment opportunities approach to valuation; Young and O’Byrne’s (2001) Adjusted EVA; Keynes’s (1936) user cost; Drukarczyk and Schueler’s (2000) Net Economic Income; Fernández’s (2002) Created Shareholder Value; Anthony’s (1975) profit. They are all conveniently reinterpreted within the theoretical domain of the lost-capital paradigm and conjoined in a unified view. The results found make this new theoretical approach a good candidate for firm valuation, capital budgeting decision-making, managerial incentives and control.     

A general form of Jordan-type double inequality for the generalized and normalized Bessel functions

In this note, a general form of Jordan-type double inequality involving the generalized and normalized Bessel functions is presented, and then some recent results concerning generalized and sharp work of Jordan’s inequality are extended. At the same time, the applications of the results above give two new infinite series for sinx/x and sinhx/x.     

Krull’s theory for the double gamma function

The Barnes’ G-function G(x) = 1/Γ₂, satisfies the functional equation logG(x + 1) − logG(x) = logΓ(x). We complement W. Krull’s work in Bemerkungen zur Differenzengleichung g(x + 1) − g(x) = φ(x), Math. Nachrichten 1 (1948), 365-376 with additional results that yield a different characterization of the function G, new expansions and sharp bounds for G on x > 0 in terms of Gamma and Digamma functions, a new expansion for the Gamma function and summation formulae with Polygamma functions.     

On some integral inequalities in n independent variables and their applications

Using Young's technique which is based on a Riemann function, we unify some inequalities of Young and Pachpatte in n independent variables. We can use these inequalities in the analysis of a class of nonlinear hyperbolic partial integrodifferential equations to study the uniqueness, boundedness, continuous dependence, comparison, stability and numerical computations.     

Scoring rule and majority agreements for large electorates with arbitrary preferences

This paper examines elections among three candidates when the electorate is large and voters can have any of the 26 nontrivial asymmetric binary relations on the candidates as their preference relations. Comparisons are made between rule-λ rankings based on rank-order ballots and simple majorities based on the preference relations. The rule-λ ranking is the decreasing point total order obtained when 1, λ and 0 points are assigned to the candidates ranked first, second and third on each voter's ballot, with 0 ? λ ? 1.Limit probabilities as the number of voters gets large are computed for events such as ‘the first-ranked rule-λ candidate has a majority over the second-ranked rule-λ candidate’ and ‘the rule-λ winner is the Condorcet candidate, given that there is a Condorcet candidate’. The probabilities are expressed as functions of λ and the distribution of voters over types of preference relations. In general, they are maximized at λ = 1/2 (Borda) and minimized at λ = 0 (plurality) and at λ = 1 for any fixed distribution of voters over preference types. The effects of more indifference and increased intransitivity in voter's preference relations are analyzed when λ is fixed.     

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.     

Influence of friction in material characterization in microindentation measurement

A comprehensive computational study is undertaken to identify the influence of friction in material characterization by indentation measurement based on elasto- plastic solids. The impacts of friction on load versus indentation depth curve, and the values of calculated hardness and Young’s modulus in conical and spherical indentations are shown in this paper. The results clearly demonstrate that, for some elasto-plastic materials, the curves of load versus indentation depth obtained either by spherical or conical indenters with different friction coefficients, cannot be distinguished. However, if utilizing the parameter β (see text for details), to quantify the deformation of piling-up or sinking-in, it is easy to find that the influence of friction on piling-up or sinking-in in indentation is significant. Therefore, the material parameters which are related to the projected area will also have a large error caused by the influence of friction. The maximum differences on hardness and Young’s modulus can reach 14.59% and 6.78%, respectively, for some elastic materials shown in this paper. These results do not agree with those from researchers who stated that the instrumented indentation experiments are not significantly affected by friction.     

Comparing financial investments by their state dependent returns: A one-way log utility representation

In a standard single-period model under risk, we formalize and discuss an intuitive criterion for the binary comparison of financial investments. Two investments – x and y – are compared by calculating the present value of x’s payoffs using the state dependent returns of y as discount factors. The induced preference is asymmetric but exhibits intransitive indifference. If the feasible set is convex, then the criterion selects a unique maximum element. Interestingly, it can be shown that the induced preference can be represented by a one-way expected utility representation employing logarithmic utility. Besides giving a relevant and illustrative example for a one-way utility representation, this result provides a new interpretation of using logarithmic utility for expected utility based decision-making.     

Comparison of path-complete Lyapunov functions via template-dependent lifts

This paper investigates, in the context of discrete-time switched systems, the problem of comparison for path-complete stability certificates. We introduce and study abstract operations on path-complete graphs, called lifts, which allow us to recover previous results in a general framework. Moreover, this approach highlights the existing relations between the analytical properties of the chosen set of candidate Lyapunov functions (the template) and the admissibility of certain lifts. This provides a new methodology for the characterization of the ordering relation of path-complete Lyapunov functions criteria, when a particular template is chosen. We apply our results to specific templates, notably the sets of primal and dual copositive norms, providing new stability certificates for positive switched systems. These tools are finally illustrated with the aim of numerical examples.     

Normal integral bases for cyclic Kummer extensions

Let K/F be a Kummer cyclic extension of number fields. In the case when the degree is a prime number, Gómez Ayala gave an explicit criterion for the existence of a normal integral basis. More recently Ichimura proposed a generalization of that result for cyclic extensions of arbitrary degree, but we have found that Ichimura’s result is incorrect. In this paper we present a counter-example to Ichimura’s result as well as the correct generalization of Gómez Ayala’s result.     

Absolutely (completely) monotonic functions and Jordan-type inequalities

Detailed analysis shows that a function f admits the double Jordan-type inequality if and only if f is analytic and even. Associated with f is the function g with f(x)=g(x²). In this short note, based on this association, and using properties of absolutely and/or (completely) monotonic functions, we propose a concise method to derive the inequality from the coefficients in the Taylor’s series of f. The results include some existing ones as special cases.     

Realization of digraphs by preferences based on distances in graphs

Consider a graph G with two distinguished sets of vertices: the voters and the candidates. A voter v prefers candidate x to candidate y if d(v, x) < d(v, y). This preference relation defines an asymmetric digraph whose vertices are the candidates, in which there is an arc from candidate x to candidate y if and only if more voters prefer x to y than prefer y to x. T. W. Johnson and P. J. Slater (“Realization of Majority Preference Digraphs by Graphically Determined Voting Patterns,” Congressus Numerantium, vol. 67 [1988] 175-186) have shown that each asymmetric digraph of order n can be realized in this way using a graph of order O(n²). We present a new construction reducing the quadratic upper bound to a linear bound. © 1995 John Wiley & Sons, Inc.     

Estimation of regression contour clusters—an application of the excess mass approach to regression

The paper shows that the technique known as excess mass can be translated to non-parametric regression with random design in d-dimensional Euclidean space, where the regression function m is given by m(x)=E(Y∣X=x),x∈R^d. The approach is applied to estimating regression contour clusters, which are sets where m exceeds a certain threshold value. This is accomplished without prior estimation of the regression function. Consistency of the resulting estimators is studied, and a functional central limit theorem for the excess mass is derived in the regression context.     

Optimal bounds for the no-show paradox via SAT solving

One of the most important desirable properties in social choice theory is Condorcet-consistency, which requires that a voting rule should return an alternative that is preferred to any other alternative by some majority of voters. Another desirable property is participation, which requires that no voter should be worse off by joining an electorate. A seminal result by Moulin (1988) has shown that Condorcet-consistency and participation are incompatible whenever there are at least 4 alternatives and 25 voters. We leverage SAT solving to obtain an elegant human-readable proof of Moulin’s result that requires only 12 voters. Moreover, the SAT solver is able to construct a Condorcet-consistent voting rule that satisfies participation as well as a number of other desirable properties for up to 11 voters, proving the optimality of the above bound. We also obtain tight results for set-valued and probabilistic voting rules, which complement and significantly improve existing theorems.     

On a refinement of Craig’s lattices

Let p be an odd prime. A family of (p−1)-dimensional over-lattices yielding new record packings for several values of p in the interval [149…3001] is presented. The result is obtained by modifying Craig’s construction and considering conveniently chosen Z-submodules of Q(ζ), where ζ is a primitive pth root of unity. For p≥59, it is shown that the center density of the (p−1)-dimensional lattice in the new family is at least twice the center density of the (p−1)-dimensional Craig lattice.     

Robust Hurwitz stability via sign-definite decomposition

In this paper, we first consider the problem of determining the robust positivity of a real function f(x) as the real vector x varies over a box X∈R^l. We show that, it is sufficient to check a finite number of specially constructed points. This is accomplished by using some results on sign-definite decomposition. We then apply this result to determine the robust Hurwitz stability of a family of complex polynomials whose coefficients are polynomial functions of the parameters of interest. We develop an eight polynomial vertex stability test that is a sufficient condition of Hurwitz stability of the family. This test reduces to Kharitonov’s well known result for the special case where the parameters are just the polynomial coefficients. In this case, the result is tight. This test can be recursively and modularly used to construct an approximation of arbitrary accuracy to the actual stabilizing set. The result is illustrated by examples.     

A kind of multiquadric quasi-interpolation operator satisfying any degree polynomial reproduction property to scattered data

In this paper, by virtue of using the linear combinations of the shifts of f(x) to approximate the derivatives of f(x) and Waldron’s superposition idea (2009), we modify a multiquadric quasi-interpolation with the property of linear reproducing to scattered data on one-dimensional space, such that a kind of quasi-interpolation operator L_r+1f has the property of r+1(r∈Z,r≥0) degree polynomial reproducing and converges up to a rate of r+2. There is no demand for the derivatives of f in the proposed quasi-interpolation L_r+1f, so it does not increase the orders of smoothness of f. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operators with that of Wu-Schaback’s quasi-interpolation scheme and Feng-Li’s quasi-interpolation scheme.     

On the normal density of primes in short intervals

Selberg has shown on the basis of the Riemann hypothesis that for every ε > 0 most intervals |x,x+x^?| of length x^? contain approximately $\text{x}{}^{\mathrm{?}}\text{log}\text{x}$ primes. Here by “most” we mean “for a set of values of x of asymptotic density one.” Prachar has extended Selberg's result to primes in arithmetic progressions. Both authors noted that if we assume the quasi Riemann hypothesis, that ζ(s) has no zeros in the domain {$\text{σ>}\text{1}\text{2}\text{+δ}$} for some $\text{δ<}\text{1}\text{2}$, then the same conclusions hold, provided that ε > 2 δ. Here we give a simple proof of these theorems in a general context, where an arbitrary signed measure takes the place of d[ψ(x)?x]. Then we show by a counterexample that this general theorem is the best of its kind: the condition ε > 2δ cannot be replaced by ε = 2δ. In our example, the associated Dirichlet integral is an entire function which remains bounded on the domain {$\text{σ≥}\text{1}\text{2}\text{+δ}$}. Thus its growth and regularity properties are better than those of $\text{ζ′(s)}\text{ζ(s)}$. Nevertheless the corresponding signed measure behaves badly.