Abraham Berman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Abraham Berman has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Miryam Berezina
ORT Braude College
2 shared publicationsNaomi Shaked-Monderer
2 shared publicationsBoris Koichu
Department of Mathematics University of California, San Diego, CA, USA
1 shared publicationBuma Abramovitz
ORT Braude College
1 shared publication- Buma Abramovitz
Department of Mathematics Ort Braude College P.O.B. 78 Karmiel 21982 Israel
1 shared publication - Changqing Xu
School of Mathematical Sciences, Suzhou University of Science and Technology, Suzhou, China
1 shared publication
Latest Publications
- Open Access
- 15 January 2016
- Published by Bastas Publications in European Journal of Science and Mathematics Education
- Vol. 4 (1) , 26-32
Definitions are important: the case of linear algebra
In this paper we describe an experiment in a linear algebra course. The aim of the experiment was to promote the students' understanding of the studied concepts focusing on their definitions. It seems to be a given that students should understand concepts’ definitions before working substantially with them. Unfortunately, in many cases they do not. Influenced by their high school experience they concentrate in learning patterns for problem solving without deep understanding of the relevant concepts. In order to educate the students to appreciate the importance of understanding definitions, we changed the homework problems and the didactical contract with the students. We discuss the positive outcomes of these changes from theoretical and educational points of view. We chose to try our approach in a linear algebra course since it is probably the most abstract course for first semester students. We hope that our approach can be useful in teaching other undergraduate courses.
- 15 January 2016
- Published by Bastas Publications in European Journal of Science and Mathematics Education
- Vol. 4 (1) , 26-32
Open AccessDefinitions are important: the case of linear algebra
In this paper we describe an experiment in a linear algebra course. The aim of the experiment was to promote the students' understanding of the studied concepts focusing on their definitions. It seems to be a given that students should understand concepts’ definitions before working substantially with them. Unfortunately, in many cases they do not. Influenced by their high school experience they concentrate in learning patterns for problem solving without deep understanding of the relevant concepts. In order to educate the students to appreciate the importance of understanding definitions, we changed the homework problems and the didactical contract with the students. We discuss the positive outcomes of these changes from theoretical and educational points of view. We chose to try our approach in a linear algebra course since it is probably the most abstract course for first semester students. We hope that our approach can be useful in teaching other undergraduate courses.
- 6 August 2015
- Published by Springer Nature in Optimization Letters
- Vol. 10 (3) , 433-446
Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- 6 August 2015
- Published by Springer Nature in Optimization Letters
- Vol. 10 (3) , 433-446
Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- 21 January 2014
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 63 (2) , 384-396
New results on the cp-rank and related properties of co(mpletely )positive matrices
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone of completely positive matrices of the same order are dual to each other with respect to the standard scalar product on the space of symmetric matrices. This paper establishes some new relations between orthogonal pairs of such matrices lying on the boundary of either cone. As a consequence, we can establish an improvement on the upper bound of the cp-rank of completely positive matrices of general order, and a further improvement for such matrices of order six.Comment: 15 pages; Following a minor revision: improved set notations, phrasing of some proofs (Cor. 2.1, Prop. 4.2
- 21 January 2014
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 63 (2) , 384-396
New results on the cp-rank and related properties of co(mpletely )positive matrices
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone of completely positive matrices of the same order are dual to each other with respect to the standard scalar product on the space of symmetric matrices. This paper establishes some new relations between orthogonal pairs of such matrices lying on the boundary of either cone. As a consequence, we can establish an improvement on the upper bound of the cp-rank of completely positive matrices of general order, and a further improvement for such matrices of order six.Comment: 15 pages; Following a minor revision: improved set notations, phrasing of some proofs (Cor. 2.1, Prop. 4.2
- Open Access
Zero forcing for sign patterns
We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i.e. zero-nonzero pattern). Our new variant provides an analo- gous bound for the maximum nullity of a matrix with a given sign pattern. This allows us to compute, for instance, the maximum nullity of a Z-matrix whose graph is L(K_{n}), the line graph of a clique.
Open AccessZero forcing for sign patterns
We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i.e. zero-nonzero pattern). Our new variant provides an analo- gous bound for the maximum nullity of a matrix with a given sign pattern. This allows us to compute, for instance, the maximum nullity of a Z-matrix whose graph is L(K_{n}), the line graph of a clique.
- 1 April 2011
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 434 (7) , 1656-1662
On the Colin de Verdière number of graphs
- 1 April 2011
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 434 (7) , 1656-1662
On the Colin de Verdière number of graphs
- 21 September 2007
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 55 (5) , 439-456
Uniform and minimal {0,1} – cpmatrices
Let A be an n × n real matrix. A is called {0,1}-cp if it can be factorized as A = BB T with bij =0 or 1. The smallest possible number of columns of B in such a factorization is called the {0,1}-rank of A. A {0,1}-cp matrix A is called minimal if for every nonzero nonnegative n × n diagonal matrix D, A-D is not {0,1}-cp, and r-uniform if it can be factorized as A=BB T, where B is a (0, 1) matrix with r 1s in each column. In this article, we first present a necessary condition for a nonsingular matrix to be {0,1}-cp. Then we characterize r-uniform {0,1}-cp matrices. We also obtain some necessary conditions and sufficient conditions for a matrix to be minimal {0,1}-cp, and present some bounds for {0,1}-ranks.
- 21 September 2007
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 55 (5) , 439-456
Uniform and minimal {0,1} – cpmatrices
Let A be an n × n real matrix. A is called {0,1}-cp if it can be factorized as A = BB T with bij =0 or 1. The smallest possible number of columns of B in such a factorization is called the {0,1}-rank of A. A {0,1}-cp matrix A is called minimal if for every nonzero nonnegative n × n diagonal matrix D, A-D is not {0,1}-cp, and r-uniform if it can be factorized as A=BB T, where B is a (0, 1) matrix with r 1s in each column. In this article, we first present a necessary condition for a nonsingular matrix to be {0,1}-cp. Then we characterize r-uniform {0,1}-cp matrices. We also obtain some necessary conditions and sufficient conditions for a matrix to be minimal {0,1}-cp, and present some bounds for {0,1}-ranks.
- 1 October 2005
- Published by SAGE Publications in Gifted Education International
- Vol. 20 (2) , 220-228
‘Good Research’ Conducted by Talented High School Students: The Case of Sci-Tech
In this paper, we present SciTech, the summer international research program for talented high school students, organized in the Technion — Israel Institute of Technology [1] [1] The first author of this paper is proud of founding SciTech in 1992 when he was the head of the Harry and Lou Stern Family Science and Technology Youth Center at the Technion. Information on the various activities of the Youth Center aimed at promotion of excellence and interest in mathematics, science and technology of high school students can be found in the website of the Technion ( http://www.mechina.technion.ac.il/en/index.html ) . Our major thesis is that while taking part in scientific projects under supervision by the Technion research stuff, the high school participants in SciTech are given the opportunity to work as researchers, and not just as learners. We begin with a brief discussion of the term ‘good research.’ This is followed by a description of SciTech: we outline how students are accepted to the program and what they do in it. The main part of this paper is devoted to discussion of some, not necessarily the most successful, mathematical projects, which we had the pleasure to supervise. We conclude the paper with general observations concerning the projects, based on our experience as SciTech mentors.
- 1 October 2005
- Published by SAGE Publications in Gifted Education International
- Vol. 20 (2) , 220-228
‘Good Research’ Conducted by Talented High School Students: The Case of Sci-Tech
In this paper, we present SciTech, the summer international research program for talented high school students, organized in the Technion — Israel Institute of Technology [1] [1] The first author of this paper is proud of founding SciTech in 1992 when he was the head of the Harry and Lou Stern Family Science and Technology Youth Center at the Technion. Information on the various activities of the Youth Center aimed at promotion of excellence and interest in mathematics, science and technology of high school students can be found in the website of the Technion ( http://www.mechina.technion.ac.il/en/index.html ) . Our major thesis is that while taking part in scientific projects under supervision by the Technion research stuff, the high school participants in SciTech are given the opportunity to work as researchers, and not just as learners. We begin with a brief discussion of the term ‘good research.’ This is followed by a description of SciTech: we outline how students are accepted to the program and what they do in it. The main part of this paper is devoted to discussion of some, not necessarily the most successful, mathematical projects, which we had the pleasure to supervise. We conclude the paper with general observations concerning the projects, based on our experience as SciTech mentors.
- 15 May 2005
- Published by Taylor & Francis in International Journal of Mathematical Education in Science and Technology
- Vol. 36 (4) , 428-437
How not to formulate multiple choice problems
This note discusses some of the shortcomings of multiple choice tests in Mathematics given to undergraduate engineering students. Examples are presented, where the disadvantages of a multiple choice test are pointed out and suggestions how to overcome the difficulties are given.
- 15 May 2005
- Published by Taylor & Francis in International Journal of Mathematical Education in Science and Technology
- Vol. 36 (4) , 428-437
How not to formulate multiple choice problems
This note discusses some of the shortcomings of multiple choice tests in Mathematics given to undergraduate engineering students. Examples are presented, where the disadvantages of a multiple choice test are pointed out and suggestions how to overcome the difficulties are given.
- 1 January 2003
- Published by Taylor & Francis in International Journal of Mathematical Education in Science and Technology
- Vol. 34 (5) , 756-764
Classroom note: Useful mistakes
Several examples of test problems are presented in which students are asked to identify mistakes in given wrong proofs.
- 1 January 2003
- Published by Taylor & Francis in International Journal of Mathematical Education in Science and Technology
- Vol. 34 (5) , 756-764
Classroom note: Useful mistakes
Several examples of test problems are presented in which students are asked to identify mistakes in given wrong proofs.
- 1 April 2000
- Published by Springer Nature in Mathematics Education Research Journal
- Vol. 12 (1) , 18-36
Learning through teaching: The case of symmetry
- 1 April 2000
- Published by Springer Nature in Mathematics Education Research Journal
- Vol. 12 (1) , 18-36
Learning through teaching: The case of symmetry