18 resultados para Degree in mathematics
em Indian Institute of Science - Bangalore - Índia
Resumo:
A d-dimensional box is a Cartesian product of d closed intervals on the real line. The boxicity of a graph is the minimum dimension d such that it is representable as the intersection graph of d-dimensional boxes. We give a short constructive proof that every graph with maximum degree D has boxicity at most 2D2. We also conjecture that the best upper bound is linear in D.
Resumo:
One influential image that is popular among scientists is the view that mathematics is the language of nature. The present article discusses another possible way to approach the relation between mathematics and nature, which is by using the idea of information and the conceptual vocabulary of cryptography. This approach allows us to understand the possibility that secrets of nature need not be written in mathematics and yet mathematics is necessary as a cryptographic key to unlock these secrets. Various advantages of such a view are described in this article.
Resumo:
An explicit construction of all the homogeneous holomorphic Hermitian vector bundles over the unit disc D is given. It is shown that every such vector bundle is a direct sum of irreducible ones. Among these irreducible homogeneous holomorphic Hermitian vector bundles over D, the ones corresponding to operators in the Cowen-Douglas class B-n(D) are identified. The classification of homogeneous operators in B-n(D) is completed using an explicit realization of these operators. We also show how the homogeneous operators in B-n(D) split into similarity classes. (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
In this article we review classical and modern Galois theory with historical evolution and prove a criterion of Galois for solvability of an irreducible separable polynomial of prime degree over an arbitrary field k and give many illustrative examples.
Resumo:
Impairment of Akt phosphorylation, a critical survival signal, has been implicated in the degeneration of dopaminergic neurons in Parkinson's disease. However, the mechanism underlying pAkt loss is unclear. In the current study, we demonstrate pAkt loss in ventral midbrain of mice treated with dopaminergic neurotoxin, 1-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), when compared to ventral midbrain of control mice treated with vehicle alone. Thiol residues of the critical cysteines in Akt are oxidized to a greater degree in mice treated with MPTP, which is reflected as a 40% loss of reduced Akt. Association of oxidatively modified Akt with the phosphatase PP2A, which can lead to enhanced dephosphorylation of pAkt, was significantly stronger after MPTP treatment. Maintaining the protein thiol homeostasis by thiol antioxidants prevented loss of reduced Akt, decreased association with PP2A, and maintained pAkt levels. Overexpression of glutaredoxin, a protein disulfide oxidoreductase, in human primary neurons helped sustain reduced state of Akt and abolished MPP+-mediated pAkt loss. We demonstrate for the first time the selective loss of Akt activity, in vivo, due to oxidative modification of Akt and provide mechanistic insight into oxidative stress-induced down-regulation of cell survival pathway in mouse midbrain following exposure to MPTP.-Durgadoss, L., Nidadavolu, P., Khader Valli, R., Saeed, U., Mishra, M., Seth, P., Ravindranath, R. Redox modification of Akt mediated by the dopaminergic neurotoxin MPTP, in mouse midbrain, leads to down-regulation of pAkt. FASEB J. 26, 1473-1483 (2012). www.fasebj.org
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:
In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.
Resumo:
This paper describes the architecture of a multiprocessor system which we call the Broadcast Cube System (BCS) for solving important computation intensive problems such as systems of linear algebraic equations and Partial Differential Equations (PDEs), and highlights its features. Further, this paper presents an analytical performance study of the BCS, and it describes the main details of the design and implementation of the simulator for the BCS.
Resumo:
Complexity theory is an important and growing area in computer science that has caught the imagination of many researchers in mathematics, physics and biology. In order to reach out to a large section of scientists and engineers, the paper introduces elementary concepts in complexity theory in a informal manner, motivating the reader with many examples.
Resumo:
The existence of an optimal feedback law is established for the risk-sensitive optimal control problem with denumerable state space. The main assumptions imposed are irreducibility and a near monotonicity condition on the one-step cost function. A solution can be found constructively using either value iteration or policy iteration under suitable conditions on initial feedback law.
Resumo:
Polymer composites are generally filled with either fibrous or particulate materials to improve the mechanical properties. In choosing the fillers one looks for materials that are inexpensive and available in abundance, in order to realize a cost reduction also. Also, often these fibres/fillers are treated to improve the matrix adhesion and thereby mechanical properties. The present study is focussed on the influence of water ingression in such filler-modified composites and the attendant changes in the compressive properties. The changes in property effected following exposure to aqueous media and the influence interface modification has on the scenario is emphasized in the work. It is seen that for plain epoxy and fly ash filled systems the strengths are increased following exposure to aqueous media. The composites with surface-treated ash particles, on the other hand, record a drop in the values. Modulus values show are increased to varying degree in unfilled and filled systems. The study also includes a fractographic analysis of the tested samples with and without exposure to water.
Resumo:
In this paper, we develop and analyze C(0) penalty methods for the fully nonlinear Monge-Ampere equation det(D(2)u) = f in two dimensions. The key idea in designing our methods is to build discretizations such that the resulting discrete linearizations are symmetric, stable, and consistent with the continuous linearization. We are then able to show the well-posedness of the penalty method as well as quasi-optimal error estimates using the Banach fixed-point theorem as our main tool. Numerical experiments are presented which support the theoretical results.
Resumo:
For a contraction P and a bounded commutant S of P. we seek a solution X of the operator equation S - S*P = (1 - P* P)(1/2) X (1 - P* P)(1/2) where X is a bounded operator on (Ran) over bar (1 - P* P)(1/2) with numerical radius of X being not greater than 1. A pair of bounded operators (S, P) which has the domain Gamma = {(z(1) + z(2), z(2)): vertical bar z(1)vertical bar < 1, vertical bar z(2)vertical bar <= 1} subset of C-2 as a spectral set, is called a P-contraction in the literature. We show the existence and uniqueness of solution to the operator equation above for a Gamma-contraction (S, P). This allows us to construct an explicit Gamma-isometric dilation of a Gamma-contraction (S, P). We prove the other way too, i.e., for a commuting pair (S, P) with parallel to P parallel to <= 1 and the spectral radius of S being not greater than 2, the existence of a solution to the above equation implies that (S, P) is a Gamma-contraction. We show that for a pure F-contraction (S, P), there is a bounded operator C with numerical radius not greater than 1, such that S = C + C* P. Any Gamma-isometry can be written in this form where P now is an isometry commuting with C and C. Any Gamma-unitary is of this form as well with P and C being commuting unitaries. Examples of Gamma-contractions on reproducing kernel Hilbert spaces and their Gamma-isometric dilations are discussed. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
We study zero-sum risk-sensitive stochastic differential games on the infinite horizon with discounted and ergodic payoff criteria. Under certain assumptions, we establish the existence of values and saddle-point equilibria. We obtain our results by studying the corresponding Hamilton-Jacobi-Isaacs equations. Finally, we show that the value of the ergodic payoff criterion is a constant multiple of the maximal eigenvalue of the generators of the associated nonlinear semigroups.
Resumo:
We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings extend smoothly up to the closures of the domains, provided each factor of the source satisfies Condition R. It also shown that the number of smoothly bounded factors in the source and target must be the same, and the proper holomorphic map splits as a product of proper mappings between the factor domains. (C) 2013 Elsevier Inc. All rights reserved.