989 resultados para Prove
Resumo:
The classical Erdos-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has been well studied and finding tight asymptotic bounds is considered a challenging open problem. Several variants of the Erdos-Szekeres problem have been posed and studied in the last two decades. The well studied variants include the empty convex k-gon problem, convex k-gon with specified number of interior points and the chromatic variant. In this paper, we introduce the following two player game variant of the Erdos-Szekeres problem: Consider a two player game where each player playing in alternate turns, place points in the plane. The objective of the game is to avoid the formation of the convex k-gon among the placed points. The game ends when a convex k-gon is formed and the player who placed the last point loses the game. In our paper we show a winning strategy for the player who plays second in the convex 5-gon game and the empty convex 5-gon game by considering convex layer configurations at each step. We prove that the game always ends in the 9th step by showing that the game reaches a specific set of configurations.
Resumo:
We prove a nonvanishing result for Koecher-Maass series attached to Siegel cusp forms of weight k and degree n in certain strips on the complex plane. When n = 2, we prove such a result for forms orthogonal to the space of the Saito-Kurokawa lifts `up to finitely many exceptions', in bounded regions. (C) 2015 Elsevier Inc. All rights reserved.
Resumo:
We prove a sub-convex estimate for the sup-norm of L-2-normalized holomorphic modular forms of weight k on the upper half plane, with respect to the unit group of a quaternion division algebra over Q. More precisely we show that when the L-2 norm of an eigenfunction f is one, parallel to f parallel to(infinity) <<(epsilon) k(1/2-1/33+epsilon) for any epsilon > 0 and for all k sufficiently large.
Resumo:
We investigate the evolution of hydromagnetic perturbations in a small section of accretion disks. It is known that molecular viscosity is negligible in accretion disks. Hence, it has been argued that a mechanism, known as magnetorotational instability (MRI), is responsible for transporting matter in the presence of a weak magnetic field. However, there are some shortcomings, which question the effectiveness of MRI. Now the question arises, whether other hydromagnetic effects, e.g., transient growth (TG), can play an important role in bringing nonlinearity into the system, even at weak magnetic fields. In addition, it should be determined whether MRI or TG is primarily responsible for revealing nonlinearity in order to make the flow turbulent. Our results prove explicitly that the flows with a high Reynolds number (Re), which is the case for realistic astrophysical accretion disks, exhibit nonlinearity via TG of perturbation modes faster than that by modes producing MRI. For a fixed wave vector, MRI dominates over transient effects only at low Re, lower than the value expected to be in astrophysical accretion disks, and low magnetic fields. This calls into serious question the (overall) persuasiveness of MRI in astrophysical accretion disks.
Resumo:
Single-phase DC/AC power electronic converters suffer from pulsating power at double the line frequency. The commonest practice to handle the issue is to provide a huge electrolytic capacitor for smoothening out the ripple. But, the electrolytic capacitors having short end of lifetimes limit the overall lifetime of the converter. Another way of handling the ripple power is by active power decoupling (APD) using the storage devices and a set of semiconductor switches. Here, a novel topology has been proposed implementing APD. The topology claims the benefit of 1) reduced stress on converter switches 2) using smaller capacitance value thus alleviating use of electrolytic capacitor in turn improving the lifetime of the converter. The circuit consists of a third leg, a storage capacitor and a storage inductor. The analysis and the simulation results are shown to prove the effectiveness of the topology.
Resumo:
In this article, we study risk-sensitive control problem with controlled continuous time Markov chain state dynamics. Using multiplicative dynamic programming principle along with the atomic structure of the state dynamics, we prove the existence and a characterization of optimal risk-sensitive control under geometric ergodicity of the state dynamics along with a smallness condition on the running cost.
Resumo:
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).
Resumo:
Three vinylene linked diketopyrrolopyrrole based donor acceptor (D-A) copolymers have been synthesized with phenyl, thienyl, and selenyl units as donors. Optical and electronic properties were investigated with UV-vis absorption spectroscopy, cyclic voltammetry, near edge X-ray absorption spectroscopy, organic field effect transistor (OFET) measurements, and density functional theory (DFT) calculations. Optical and electrochemical band gaps decrease in the order phenyl, thienyl, and selenyl. Only phenyl-based polymers are nonplanar, but the main contributor to the larger band gap is electronic, not structural effects. Thienyl and selenyl polymers exhibit ambipolar charge transport but with higher hole than electron mobility. Experimental and theoretical results predict the selenyl system to have the best transport properties, but OFET measurements prove the thienyl system to be superior with p-channel mobility as high as 0.1 cm(2) V-1 s(-1).
Resumo:
In 1987, Kalai proved that stacked spheres of dimension d >= 3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d = 2. In this article, we give a characterisation of stacked 2-spheres using what we call the separation index. Namely, we show that the separation index of a triangulated 2-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all n-vertex triangulated 2-spheres, the separation index is minimised by some n-vertex flag sphere for n >= 6. Furthermore, we apply this characterisation of stacked 2-spheres to settle the outstanding 3-dimensional case of the Lutz-Sulanke-Swartz conjecture that ``tight-neighbourly triangulated manifolds are tight''. For dimension d >= 4, the conjecture has already been proved by Effenberger following a result of Novik and Swartz. (C) 2015 Elsevier Inc. All rights reserved.
Resumo:
We prove that given a Hecke-Maass form f for SL(2, Z) and a sufficiently large prime q, there exists a primitive Dirichlet character chi of conductor q such that the L-values L(1/2, f circle times chi) and L(1/2, chi) do not vanish.
Resumo:
In this paper we prove weighted mixed norm estimates for Riesz transforms on the Heisenberg group and Riesz transforms associated to the special Hermite operator. From these results vector-valued inequalities for sequences of Riesz transforms associated to generalised Grushin operators and Laguerre operators are deduced.
Resumo:
We find the sum of series of the form Sigma(infinity)(i=1) f(i)/i(r) for some special functions f. The above series is a generalization of the Riemann zeta function. In particular, we take f as some values of Hurwitz zeta functions, harmonic numbers, and combination of both. These generalize some of the results given in Mezo's paper (2013). We use multiple zeta theory to prove all results. The series sums we have obtained are in terms of Bernoulli numbers and powers of pi.
Resumo:
Single-phase DC/AC power electronic converters suffer from pulsating power at double the line frequency. The commonest practice to handle the issue is to provide a huge electrolytic capacitor for smoothening out the ripple. But, the electrolytic capacitors having short end of lifetimes limit the overall lifetime of the converter. Another way of handling the ripple power is by active power decoupling (APD) using the storage devices and a set of semiconductor switches. Here, a novel topology has been proposed implementing APD. The topology claims the benefit of 1) reduced stress on converter switches 2) using smaller capacitance value thus alleviating use of electrolytic capacitor in turn improving the lifetime of the converter. The circuit consists of a third leg, a storage capacitor and a storage inductor. The analysis and the simulation results are shown to prove the effectiveness of the topology.
Resumo:
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Omega(root d/t) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials.
Resumo:
In this paper, we study sum secrecy rate in multicarrier decode-and-forward relay beamforming. We obtain the optimal source power and relay weights on each subcarrier which maximize the sum secrecy rate. For a given total power on a given subcarrier k, P-0(k), we reformulate the optimization problem by relaxing the rank-1 constraint on the complex positive semidefinite relay weight matrix, and solve using semidefinite programming. We analytically prove that the solution to the relaxed optimization problem is indeed rank 1. We show that the subcarrier secrecy rate, R-s (P-0(k)), is a concave function in total power P-0(k) if R-s (P-0(k)) > 0 for any P-0(k) > 0. Numerical results show that the sum secrecy rate with optimal power allocation across subcarriers is more than the sum secrecy rate with equal power allocation. We also propose a low complexity suboptimal power allocation scheme which outperforms equal power allocation scheme.