Problem solving 1

The purposes of research: Searching of dark matter in the proposed model called the simple 3-3-1 model (S331M); solving the neutrino mass problem and determine the Higgs spectrum in the G221 model with lepton-flavor non-universality.

34p capheviahe27 23-02-2021 11 4   Download

The results of this thesis are: Propose and prove the strong convergence of a new modification of the Newton-Kantorovich iterative regularization method (0.6) to solve the problem (0.1) with A is a monotone mapping from Banach space E into the dual space E ∗ , which overcomes the drawbacks of method (0.6).

26p xacxuoc4321 09-07-2019 27 5   Download

Lecture "Chapter 1: The world of the modern systems analysis" provides students with the knowledge: Learning objectives, analyst’s approach to problem solving, systems that solve business problems, types of information systems,... Invite you to consult.

9p doinhugiobay_04 27-11-2015 55 1   Download

1. Tóm tắt môn học : Giới thiệu một số vấn đề chung về phương pháp luận nghiên cứu khoa học và các đặc thù của nghiên cứu, giải quyết vấn đề trong tin học, một số kinh nghiệm nghiên cứu ứng dụng trong tin học. 2. Tóm tắt bằng tiếng Anh : This course provides students general knowledge about research methodoly to solve problem on computer. Introduce research experiences and applications in computer science.

215p online_12 07-11-2013 266 29   Download

We construct an exhaustive submeasure that is not equivalent to a measure. This solves problems of J. von Neumann (1937) and D. Maharam (1947). Contents 1. Introduction 2. Roberts 3. Farah 4. The construction 5. The main estimate 6. Exhaustivity 7. Proof of Theorems 1.2 to 1.4 References 1. Introduction Consider a Boolean algebra B of sets.

30p dontetvui 17-01-2013 75 11   Download

The existence problem is solved, and global pointwise estimates of solutions are obtained for quasilinear and Hessian equations of Lane-Emden type, including the following two model problems: −∆p u = uq + µ, Fk [−u] = uq + µ, u ≥ 0, on Rn , or on a bounded domain Ω ⊂ Rn . Here ∆p is the p-Laplacian defined by ∆p u = div ( u| u|p−2 ), and Fk [u] is the k-Hessian defined as the sum of k × k principal minors of the Hessian matrix D2 u (k = 1, 2, . . . ,...

58p dontetvui 17-01-2013 58 10   Download

Given a compact four dimensional manifold, we prove existence of conformal metrics with constant Q-curvature under generic assumptions. The problem amounts to solving a fourth-order nonlinear elliptic equation with variational structure. Since the corresponding Euler functional is in general unbounded from above and from below, we employ topological methods and min-max schemes, jointly with the compactness result of [35]. 1.

48p dontetvui 17-01-2013 59 7   Download

We prove that if f (x) = n−1 ak xk is a polynomial with no cyclotomic k=0 factors whose coefficients satisfy ak ≡ 1 mod 2 for 0 ≤ k 1 + log 3 , 2n resolving a conjecture of Schinzel and Zassenhaus [21] for this class of polynomials. More generally, we solve the problems of Lehmer and Schinzel and Zassenhaus for the class of polynomials

21p noel_noel 17-01-2013 52 6   Download

Annals of Mathematics In this paper we will solve one of the central problems in dynamical systems: Theorem 1 (Density of hyperbolicity for real polynomials). Any real polynomial can be approximated by hyperbolic real polynomials of the same degree. Here we say that a real polynomial is hyperbolic or Axiom A, if the real line is the union of a repelling hyperbolic set, the basin of hyperbolic attracting periodic points and the basin of infinity.

39p noel_noel 17-01-2013 49 5   Download

We provide a class of necessary and sufficient conditions for the discreteness of spectrum of Schr¨dinger operators with scalar potentials which o are semibounded below. The classical discreteness of spectrum criterion by A. M. Molchanov (1953) uses a notion of negligible set in a cube as a set whose Wiener capacity is less than a small constant times the capacity of the cube. We prove that this constant can be taken arbitrarily between 0 and 1. This solves a problem formulated by I. M. Gelfand in 1953. Moreover, we extend the notion of negligibility by allowing the constant to...

25p noel_noel 17-01-2013 40 6   Download

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields. 1. Introduction The basic purpose of computational complexity theory is to classify computational problems according to the amount of resources required to solve them. In particular, the most basic task is to classify computational problems to those that are efficiently solvable and those that are not. ...

48p noel_noel 17-01-2013 60 6   Download

In this paper, we solve the following extension problem. Problem 1. Suppose we are given a function f : E → R, where E is a given subset of Rn. How can we decide whether f extends to a Cm−1,1 function F on Rn ? Here, m ≥ 1 is given. As usual, Cm−1,1 denotes the space of functions whose (m − 1)rst derivatives are Lipschitz 1. We make no assumption on the set E or the function f. This problem, with Cm in place of Cm−1,1, goes back to Whitney [15], [16], [17]. To answer it, we prove the following sharp form of the Whitney extension theorem....

70p noel_noel 17-01-2013 59 5   Download

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24. Contents 1. Introduction 2. Lattices, Fourier transforms, and Poisson summation 3. Principal theorems 4. Homogeneous spaces 5. Conditions for a sharp bound 6. Stationary points 7. Numerical results 8. Uniqueness Appendix A. ...

27p tuanloccuoi 04-01-2013 50 6   Download

SEMILINEAR PROBLEMS WITH BOUNDED NONLINEAR TERM MARTIN SCHECHTER Received 17 August 2004 We solve boundary value problems for elliptic semilinear equations in which no asymptotic behavior is prescribed for the nonlinear term. 1. Introduction Many authors (beginning with Landesman and Lazer [1]) have studied resonance problems for semilinear elliptic partial differential equations of the form −∆u − λ u = f (x,u) in Ω, u = 0 on ∂Ω, (1.1) where Ω is a smooth bounded domain in Rn , λ is an eigenvalue of the linear problem −∆u = λu in Ω, u = 0 on ∂Ω, (1.

8p sting12 10-03-2012 35 3   Download

NONSMOOTH AND NONLOCAL DIFFERENTIAL EQUATIONS IN LATTICE-ORDERED BANACH SPACES ¨ SIEGFRIED CARL AND S. HEIKKILA Received 7 September 2004 We derive existence results for initial and boundary value problems in lattice-ordered Banach spaces. The considered problems can be singular, functional, discontinuous, and nonlocal. Concrete examples are also solved. 1. Introduction In this paper, we apply fixed point results for mappings in partially ordered function spaces to derive existence results for initial and boundary value problems in an ordered Banach space E.

15p sting12 10-03-2012 30 4   Download

TRICHOTOMY, STABILITY, AND OSCILLATION OF A FUZZY DIFFERENCE EQUATION G. STEFANIDOU AND G. PAPASCHINOPOULOS Received 10 November 2003 We study the trichotomy character, the stability, and the oscillatory behavior of the positive solutions of a fuzzy difference equation. 1. Introduction Difference equations have already been successfully applied in a number of sciences (for a detailed study of the theory of difference equations and their applications, see [1, 2, 7, 8, 11].

21p sting12 10-03-2012 35 5   Download

EXISTENCE AND GLOBAL STABILITY OF POSITIVE PERIODIC SOLUTIONS OF A DISCRETE PREDATOR-PREY SYSTEM WITH DELAYS LIN-LIN WANG, WAN-TONG LI, AND PEI-HAO ZHAO Received 13 January 2004 We study the existence and global stability of positive periodic solutions of a periodic discrete predator-prey system with delay and Holling type III functional response. By using the continuation theorem of coincidence degree theory and the method of Lyapunov functional, some sufficient conditions are obtained. 1.

16p sting12 10-03-2012 59 5   Download

The Communication Problem Solver 1. Managers need top-flight communication skills to keep their staffs productive and collaborative. But often, those who manage lack the ability to get things back on track once miscommunication occurs. This book helps readers analyze their communication skills and challenges and explains how they can use simple problem-solving techniques to resolve the people issues that derail productivity at work. Easily accessible and filled with real world management examples.

10p pretty9 23-09-2010 161 41   Download

Short-Time Fourier Analysis A fundamental problem in signal analysis is to find the spectral components containedin a measuredsignal z ( t ) and/or to provide information about the time intervals when certain frequencies occur. An example of what we are looking for is a sheet of music, which clearly assigns time to frequency, see Figure 7.1. The classical Fourier analysis only partly solves the problem, because it does not allow an assignment of spectralcomponents to time. Therefore one seeks other transforms which give insight into signal properties in a different way. ...

14p doroxon 12-08-2010 110 6   Download