Results 1 to 10 of about 554 (70)
On the kernel of a singular integral operator with non-carleman shift and conjugation [PDF]
On the Hilbert space (L) over tilde (2)(T) the singular integral operator with non-Carleman shift and conjugation K = P+ +(aI + AC)P- is considered, where P-+/- are the Cauchy projectors, A = (m)Sigma(j=0) a(j)U(j), a, a(j), j = (1, m) over bar, are ...
Conceição, Ana C., Marreiros, Rui C.
core +2 more sources
Lower Bounds on the Number of Realizations of Rigid Graphs [PDF]
Georg Grasegger, Christoph Koutschan
exaly +2 more sources
Efficient simplicial replacement of semialgebraic sets
Designing an algorithm with a singly exponential complexity for computing semialgebraic triangulations of a given semialgebraic set has been a holy grail in algorithmic semialgebraic geometry. More precisely, given a description of a semialgebraic set
Saugata Basu, Negin Karisani
doaj +1 more source
In this work, the generalized scale-invariant analog of the Korteweg–de Vries equation is studied. For the first time, the tanh–coth methodology is used to find traveling wave solutions for this nonlinear equation.
González-Gaxiola Oswaldo +1 more
doaj +1 more source
New exact solutions of the Mikhailov-Novikov-Wang equation via three novel techniques
The current work aims to present abundant families of the exact solutions of Mikhailov-Novikov-Wang equation via three different techniques. The adopted methods are generalized Kudryashov method (GKM), exponential rational function method (ERFM), and ...
Arzu Akbulut +2 more
doaj +1 more source
In the present work, we find the Lie point symmetries of the Ricci flow on an n-dimensional manifold, and we introduce a method in order to reutilize these symmetries to obtain the Lie point symmetries of particular metrics.
López Enrique +2 more
doaj +1 more source
Evolution of group-theoretic cryptology attacks using hyper-heuristics
In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj +1 more source
Riemann-Hilbert Approach and N-Soliton Solutions For Three-Component Coupled Hirota Equations
A Riemann-Hilbert problem is employed to study integrable three-component coupled Hirota (tcCH) equations. Thus, we investigate the spectral properties of tcCH equations with a 4× 4 Lax pair and derive a Riemann-Hilbert problem, the solution of which is ...
Xin Wu, Shou-Fu Tian, Jin-Jie Yang
semanticscholar +1 more source
Polyhedral Methods in Numerical Algebraic Geometry [PDF]
In numerical algebraic geometry witness sets are numerical representations of positive dimensional solution sets of polynomial systems. Considering the asymptotics of witness sets we propose certificates for algebraic curves.
J. Verschelde
semanticscholar +1 more source
Attack on Kayawood protocol: uncloaking private keys
We analyze security properties of a two-party key-agreement protocol recently proposed by I. Anshel, D. Atkins, D. Goldfeld, and P. Gunnels, called Kayawood protocol.
Kotov Matvei +2 more
doaj +1 more source

