English
Related papers

Related papers: Algorithm for finding boundary link Seifert matric…

200 papers

The paper represents the method for construction of the families of particular solutions to some new classes of $(n+1)$ dimensional nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 A. I. Zenchuk

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…

Numerical Analysis · Mathematics 2017-05-19 Shouqiang Du , Liping Zhang , Chiyu Chen , Liqun Qi

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

Numerical Analysis · Mathematics 2025-10-20 Uwe Naumann

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Computational Complexity · Computer Science 2014-12-16 Abhishek Bhowmick , Shachar Lovett

Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special…

Combinatorics · Mathematics 2025-04-30 Tamás Kálmán , Karola Mészáros , Alexander Postnikov

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

Complex Variables · Mathematics 2008-06-16 Elin Götmark

In the study of high-dimensional data, it is often assumed that the data set possesses an underlying lower-dimensional structure. A practical model for this structure is an embedded compact manifold with boundary. Since the underlying…

Machine Learning · Statistics 2025-08-22 Pei-Cheng Kuo , Nan Wu

The Boubaker polynomials are investigated in this paper. Using Riordan matrices analysis, a sequence of relations outlining the relations with Chebyshev and Fermat polynomials have been obtained. The obtained expressions are a meaningful…

Mathematical Physics · Physics 2014-09-18 Karem Boubaker , Lin Zhang

The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…

Information Theory · Computer Science 2016-10-20 Emanuele Bellini , Teo Mora , Massimiliano Sala

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…

Data Structures and Algorithms · Computer Science 2018-02-13 Anatoly D. Plotnikov

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Optimization and Control · Mathematics 2017-08-01 Jiawang Nie , Jinling Zhao

We give a new construction of the one-variable Alexander polynomial of an oriented knot or link, and show that it generalizes to a vector valued invariant of oriented tangles.

Geometric Topology · Mathematics 2012-03-27 Stephen Bigelow

An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…

Numerical Analysis · Mathematics 2019-02-19 Shinichi Tajima , Katsuyoshi Ohara , Akira Terui

We realize a given (monic) Alexander polynomial by a (fibered) hyperbolic arborescent knot and link of any number of components, and by infinitely many such links of at least 4 components. As a consequence, a Mahler measure minimizing…

Geometric Topology · Mathematics 2007-12-07 A. Stoimenow

We provide explicit formulas for the Alexander polynomial of pretzel knots and establish several immediate corollaries, including the characterization of pretzel knots with a trivial Alexander polynomial. As an application, we construct a…

Geometric Topology · Mathematics 2026-03-10 Y. Belousov

In quantum theory, the so-called "spinless Salpeter equation," the relativistic generalization of the nonrelativistic Schroedinger equation, is used to describe both bound states of scalar particles and the spin-averaged spectra of bound…

High Energy Physics - Phenomenology · Physics 2009-10-31 Wolfgang Lucha , F. F. Schoberl

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

Algebraic Geometry · Mathematics 2023-02-07 Alicia Dickenstein , Sandra di Rocco , Ralph Morrison

In this paper, we consider a class of nonlinear fractional differential equations involving Hilfer derivative with boundary conditions. First, we obtain an equivalent integral for the given boundary value problem in weighted space of…

General Mathematics · Mathematics 2019-10-01 Mohammed S Abdo , S K Panchal , Sandeep P Bhairat

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov
‹ Prev 1 8 9 10 Next ›