搜索结果：another

We are interested in the naive problem whether we can move a solid object in a solid box or not. We restrict move to rotation. In the case we can, the centre and the ``direction'' of rotation may be restricted. Simplifying, we consider possibility of rotation of a polytope within another one of the same dimension and give a criterion for the possibility. Consider the particular case of simplices of the same dimension assuming that the vertices of the inner simplex are contained in different facets of the outer one. Premising further that simplices are even dimensional, rotation is possible in a very general situation. However, in dimension 3, the possible case is not not general. Even in these elementary phenomena, the parity of the dimension seems to yield difference.

Bandeira et al. (2017) show that the eigenvalues of the Kendall correlation matrix of $n$ i.i.d. random vectors in $\mathbb{R}^p$ are asymptotically distributed like $1/3 + (2/3)Y_q$, where $Y_q$ has a Marčenko-Pastur law with parameter $q=\lim(p/n)$ if $p, n\to\infty$ proportionately to one another. Here we show that another Marčenko-Pastur law emerges in the "ultra-high dimensional" scaling limit where $p\sim q'\, n^2/2$ for some $q'>0$: in this quadratic scaling regime, Kendall correlation eigenvalues converge weakly almost surely to $(1/3)Y_{q'}$.

Finding a Hamiltonian cycle in a given graph is computationally challenging, and in general remains so even when one is further given one Hamiltonian cycle in the graph and asked to find another. In fact, no significantly faster algorithms are known for finding another Hamiltonian cycle than for finding a first one even in the setting where another Hamiltonian cycle is structurally guaranteed to exist, such as for odd-degree graphs. We identify a graph class -- the bipartite Pfaffian graphs of minimum degree three -- where it is NP-complete to decide whether a given graph in the class is Hamiltonian, but when presented with a Hamiltonian cycle as part of the input, another Hamiltonian cycle can be found efficiently. We prove that Thomason's lollipop method~[Ann.~Discrete Math.,~1978], a well-known algorithm for finding another Hamiltonian cycle, runs in a linear number of steps in cubic bipartite Pfaffian graphs. This was conjectured for cubic bipartite planar graphs by Haddadan [MSc~thesis,~Waterloo,~2015]; in contrast, examples are known of both cubic bipartite graphs and cubic planar graphs where the lollipop method takes exponential time. Beyond the lollipop method, we address

Family members' satisfaction with one another is central to creating healthy and supportive family environments. In this work, we propose and implement a novel computational technique aimed at exploring the possible relationship between the topology of a given family tree graph and its members' satisfaction with one another. Through an extensive empirical evaluation ($N=486$ families), we show that the proposed technique brings about highly accurate results in predicting family members' satisfaction with one another based solely on the family graph's topology. Furthermore, the results indicate that our technique favorably compares to baseline regression models which rely on established features associated with family members' satisfaction with one another in prior literature.

In our effort to find an arithmetically pure proof of the Bertrand postulate, we investigate and solve (using only elementary arithmetical methods) another less usual inequality in positive integers inspired by the classical proof of the postulate given by P. Erdős.

We study how to extend Sanov theorem to the quantum setting. Although a quantum version of the Sanov theorem was proposed in Bjelakovic et al (Commun. Math. Phys., 260, p.659 (2005)), the classical case of their statement is not the same as Sanov theorem because Sanov theorem discusses the behavior of the empirical distribution when the empirical distribution is different from the true distribution, but they studied a problem related to quantum hypothesis testing, whose classical version can be shown by classical Sanov theorem. We propose another quantum version of Sanov theorem by considering the quantum analog of the empirical distribution.

Free ribbon lemma that every free sphere-link in the 4-sphere is a ribbon sphere-link is shown in an earlier paper by the author. In this paper, another proof of this lemma is given.

Based on the Sinc approximation combined with the tanh transformation, Haber derived an approximation formula for numerical indefinite integration over the finite interval (-1, 1). The formula uses a special function for the basis functions. In contrast, Stenger derived another formula, which does not use any special function but does include a double sum. Subsequently, Muhammad and Mori proposed a formula, which replaces the tanh transformation with the double-exponential transformation in Haber's formula. Almost simultaneously, Tanaka et al. proposed another formula, which was based on the same replacement in Stenger's formula. As they reported, the replacement drastically improves the convergence rate of Haber's and Stenger's formula. In addition to the formulas above, Stenger derived yet another indefinite integration formula based on the Sinc approximation combined with the tanh transformation, which has an elegant matrix-vector form. In this paper, we propose the replacement of the tanh transformation with the double-exponential transformation in Stenger's second formula. We provide a theoretical analysis as well as a numerical comparison.

One of the couple of translatable radii of an operator in the direction of another operator introduced in earlier work[13] is studied in details. A necessary and sufficient condition for a unit vector f to be a stationary vector of the generalized eigenvalue problem $ Tf = λA f $ is obtained. Finally a theorem of Williams[16] is generalized to obtain a translatable radius of an operator in the direction of another operator.

In this paper, the decades-old clustering method k-means is revisited. The original distortion minimization model of k-means is addressed by a pure stochastic minimization procedure. In each step of the iteration, one sample is tentatively reallocated from one cluster to another. It is moved to another cluster as long as the reallocation allows the sample to be closer to the new centroid. This optimization procedure converges faster to a better local minimum over k-means and many of its variants. This fundamental modification over the k-means loop leads to the redefinition of a family of k-means variants. Moreover, a new target function that minimizes the summation of pairwise distances within clusters is presented. We show that it could be solved under the same stochastic optimization procedure. This minimization procedure built upon two minimization models outperforms k-means and its variants considerably with different settings and on different datasets.

The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized Reed-Muller code over $\gf(q)$ in the literature. The major objective of this paper is to present another generalization of the punctured binary Reed-Muller code. Another objective is to construct a family of reversible cyclic codes that are related to the newly generalized Reed-Muller codes.

RAT0455+1305 was discovered during the Rapid Temporal Survey which aims in finding any variability on timescales of a few minutes to several hours. The star was found to be another sdBV star with one high amplitude mode and relatively long period. These features along with estimation of T_eff and log g makes this star very similar to Balloon 090100001. Encouraged by prominent results obtained for the latter star we have decided to perform white light photometry on RAT0455+1305. In 2009 we used the 1.5m telescope located in San Pedro Martir Observatory in Mexico. Fourier analysis confirmed the dominant mode found in the discovery data, uncovered another peak close to the dominant one, and three peaks in the low frequency region. This shows that RAT0455+1305 is another hybrid sdBV star pulsating in both p- and g-modes.

We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length $h_v$ appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.

This paper is in concern with Cauchy problems involving the fractional derivatives with respect to another function. Results of existence, uniqueness, and Taylor series among others are established in appropriate functional spaces. We prove that these results are valid at once for several standard fractional operators such as the Riemann-Liouville and Caputo operators, the Hadamard operators, the Erdélyi-Kober operators, etc., depending on the choice of the scaling function. We also show that our technique can be useful to solve a wide range of Volterra integral equations. The numerical approximation of solutions of systems involving the fractional derivatives with respect to another function is also investigated and the optimal convergence rate of the schemes is reached in graded meshes, even in the case of singular solutions. Various examples and numerical tests, with an application to the Erdélyi-Kober operators, are performed at the end to illustrate the efficiency of the proposed approach.

It is known that the additivity conjecture of Holevo capacity, output minimum entoropy, and the entanglement of formation (EoF), are equivalent with each other. Among them, the output minimum entropy is simplest, and hence many researchers are focusing on this quantity. Here, we suggest yet another entanglement measure, whose strong superadditivity and additivity are equivalent to the additivity of the quantities mentioned above. This quantity is as simple as the output minimum entropy, and in existing proofs of additivity conjecture of the output minimum entropy for the specific examples, they are essentially proving the strong superadditivity of this quantity.

In this paper we present another proof of the analytic version of the Hahn-Banach theorem in terms of convex functionals.

In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern $3412$ and another pattern.

In this paper, another proof of Pell identities is presented by using the determinant of tridiagonal matrices. It is calculated via the Laplace expansion.

In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.