English
Related papers

Related papers: The solution of the $A_r$ T-system for arbitrary b…

200 papers

In this paper, we use the network solution of the $A_r$ $T$-system to derive that of the unrestricted $A_\infty$ $T$-system, equivalent to the octahedron relation. We then present a method for implementing various boundary conditions on…

Combinatorics · Mathematics 2012-09-10 Philippe Di Francesco , Rinat Kedem

We give the path model solution for the cluster algebra variables of the $A_r$ $T$-system with generic boundary conditions. The solutions are partition functions of (strongly) non-intersecting paths on weighted graphs. The graphs are the…

Combinatorics · Mathematics 2009-08-24 P. Di Francesco , R. Kedem

We solve the quantum version of the $A_1$ $T$-system by use of quantum networks. The system is interpreted as a particular set of mutations of a suitable (infinite-rank) quantum cluster algebra, and Laurent positivity follows from our…

Mathematical Physics · Physics 2015-05-27 Philippe Di Francesco , Rinat Kedem

We define a non-commutative version of the $A_1$ T-system, which underlies frieze patterns of the integer plane. This system has discrete conserved quantities and has a particular reduction to the known non-commutative Q-system for $A_1$.…

Quantum Algebra · Mathematics 2015-06-18 P. Di Francesco

We present a method to solve initial and boundary value problems using artificial neural networks. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the boundary (or initial) conditions…

Computational Physics · Physics 2016-11-15 I. E. Lagaris , A. Likas , D. I. Fotiadis

In this review article, we present a unified approach to solving discrete, integrable, possibly non-commutative, dynamical systems, including the $Q$- and $T$-systems based on $A_r$. The initial data of the systems are seen as cluster…

Mathematical Physics · Physics 2015-05-19 Philippe Di Francesco

We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining "toric" roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more…

Algebraic Geometry · Mathematics 2014-06-05 Bernard Mourrain , Philippe Trebuchet

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

Combinatorics · Mathematics 2019-06-21 Konrad Engel , Tran Dan Thu

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

Classical Analysis and ODEs · Mathematics 2014-06-26 Pascal Auscher , Sebastian Stahlhut

Any mass action network gives rise to a parameterised family of polynomial equations whose positive solutions are the positive equilibria of the network. Here, we consider alternative systems of equations, whose solutions are in smooth,…

Molecular Networks · Quantitative Biology 2026-05-06 Murad Banaji , Elisenda Feliu

It has remained an open question for some time whether, given a set of not necessarily binary (i.e. "nonbinary") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that…

Populations and Evolution · Quantitative Biology 2012-08-03 Steven Kelk , Celine Scornavacca

In a multidimensional infinite layer bounded by two hyperplanes, the Poisson equation with the polynomial right-hand side is considered. It is shown that the Dirichlet boundary value problem and the mixed Dirichlet-Neumann boundary value…

Mathematical Physics · Physics 2017-10-17 Oleg D. Algazin

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…

Computational Complexity · Computer Science 2007-05-23 Shmuel Friedland

By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs.

Combinatorics · Mathematics 2019-12-10 Mariusz Zając

Given a continuous function on the boundary of a bounded open set in $\mathbb{R}^d$ there exists a unique bounded harmonic function, called the Perron solution, taking the prescribed boundary values at least at all regular points (in the…

Functional Analysis · Mathematics 2018-04-05 Marcel Kreuter

In this paper we study the existence of solutions for nonlinear boundary value problems ({\phi}(u' ))' = f(t,u,u'), l(u,u')=0 where l(u,u') =0 denotes the Dirichlet or mixed conditions on [0, T], {\phi} is a bounded, singular or classic…

Classical Analysis and ODEs · Mathematics 2016-06-07 Dionicio Pastor Dallos Santos

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

Partial differential equations (PDEs) with Dirichlet boundary conditions defined on boundaries with simple geometry have been succesfuly treated using sigmoidal multilayer perceptrons in previous works. This article deals with the case of…

Neural and Evolutionary Computing · Computer Science 2007-05-23 I. E. Lagaris , A. Likas , D. G. Papageorgiou

In this paper we analyse a boundary value problem for the Laplace equation with a nonlinear non-autonomous transmission conditions on the boundary of a small inclusion of size $\epsilon$. We show that the problem has solutions for…

Analysis of PDEs · Mathematics 2022-11-24 Riccardo Molinarolo

In this paper we show that every combinatorial problem has an exact explicit equation that returns its solution. We present a method to obtain an equation that solves exactly any combinatorial problem, both inversion, constraint…

Emerging Technologies · Computer Science 2025-02-11 Alejandro Mata Ali
‹ Prev 1 2 3 10 Next ›