中文
相关论文

相关论文: On Achievability of an $(r,l)$ Fractional Linear N…

200 篇论文

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

组合数学 · 数学 2018-05-01 Daniel Yaqubi , Madjid Mirzavaziri

In a recent paper Zhang and Li have doubted our claim that whenever a nonlinear equation has solutions in terms of the Jacobi elliptic functions $\cn(x,m)$ and $\dn(x,m)$, then the same nonlinear equation will necessarily also have…

斑图形成与孤子 · 物理学 2015-10-12 Avinash Khare , Avadh Saxena

A theorem on the solutions of the problem $U'(w)=\gamma F(U(w),w),\ U(w_1)=u_2,\ U(w_2)=u_2$ is applied for finding the functional solutions of the system of partial differential equations \begin{equation} \nabla\cdot(a(u,w)\nabla u)=0,\…

偏微分方程分析 · 数学 2017-11-15 Giovanni Cimatti

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…

种群与进化 · 定量生物学 2012-08-03 Steven Kelk , Celine Scornavacca

We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k^2 4^k clauses, and on the other hand, any linear k-CNF formula with at most…

离散数学 · 计算机科学 2010-10-29 Dominik Scheder

We consider the following system linearly coupled by nonlinear Schr\"odinger equations in $\R^3$ $$ \left\{\begin{array}{ll} -\Delta u_j+u_j=u^3_j-\va\sum\limits_{i\neq j}^N u_i,\{1cm}& x\in \R^3, \{0.2cm}\\ u_j\in H^1(\R^3),\quad…

偏微分方程分析 · 数学 2013-10-08 Chang-Shou Lin , Shuangjie Peng

Let $\Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $\Delta_t(n,k)$ be the subgraph of $\Gamma(n,k)$…

组合数学 · 数学 2021-07-13 Ilaria Cardinali , Luca Giuzzi , Mariusz Kwiatkowski

Piecewise fractional linear maps wzth three or more branches have been studied in several papers. For many Moebius maps the shape of the density of their invariant measurs can be written down exactly. However, if just two branches are…

动力系统 · 数学 2026-02-10 Fritz Schweiger

We develop a theory of existence and uniqueness for the following porous medium equation with fractional diffusion, $$ \{ll} \dfrac{\partial u}{\partial t} + (-\Delta)^{\sigma/2} (|u|^{m-1}u)=0, & \qquad x\in\mathbb{R}^N,\; t>0, [8pt]…

偏微分方程分析 · 数学 2011-04-05 Arturo de Pablo , Fernando Quirós , Ana Rodríguez , Juan Luis Vázquez

Project networks are characterized by power law degree distributions, a property that is known to promote spreading. In contrast, the longest path length of project networks scales algebraically with the network size, which improves the…

物理与社会 · 物理学 2024-04-26 Alexei Vazquez

Let $A \in \mathbb{R}^{n \times n}$ be invertible, $x \in \mathbb{R}^n$ unknown and $b =Ax $ given. We are interested in approximate solutions: vectors $y \in \mathbb{R}^n$ such that $\|Ay - b\|$ is small. We prove that for all $0<…

数值分析 · 数学 2022-07-08 Stefan Steinerberger

Let $X$ be a scheme. Let $r \geq 2$ be an integer. Denote by $W_r(X)$ the scheme of Witt vectors of length $r$, built out of $X$. We are concerned with the question of extending (=lifting) vector bundles on $X$, to vector bundles on…

代数几何 · 数学 2023-10-17 Charles De Clercq , Mathieu Florence , Giancarlo Lucchini Arteche

Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly…

信息论 · 计算机科学 2018-08-28 Imad Ahmad , Chih-Chun Wang

An infinite family of graphs ${\cal F}$ is called feasible if for any pair of integers $(n,m)$, $n \geq 1$, $0 \leq m \leq \binom{n}{2}$, there is a member $G \in {\cal F}$ such that $G$ has $n$ vertices and $m$ edges. We prove that given a…

组合数学 · 数学 2023-11-03 Yair Caro , Matthew Cassar , Josef Lauri , Christina Zarb

In this paper, we investigate the existence of infinitely many solutions for the following fractional Hamiltonian systems: \begin{eqnarray}\label{eq00} _{t}D_{\infty}^{\alpha}(_{-\infty}D_{t}^{\alpha}u(t)) + L(t)u(t) = & \nabla W(t,u(t))\\…

数学物理 · 物理学 2014-09-03 Amado Méndez , César Torres

A set of vertices $W$ in a graph $G$ is called resolving if for any two distinct $x,y\in V(G)$, there is $v\in W$ such that ${\rm dist}_G(v,x)\neq{\rm dist}_G(v,y)$, where ${\rm dist}_G(u,v)$ denotes the length of a shortest path between…

数据结构与算法 · 计算机科学 2018-05-01 Gregory Gutin , M. S. Ramanujan , Felix Reidl , Magnus Wahlström

Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…

数值分析 · 数学 2022-09-05 Margherita Porcelli , Valeria Simoncini

Tensor network methods provide an intuitive graphical language to describe quantum states, channels, open quantum systems and a class of numerical approximation methods that efficiently simulate certain many-body states in one spatial…

量子物理 · 物理学 2017-03-09 Jacob Biamonte

We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network…

数据结构与算法 · 计算机科学 2017-07-12 Guru Guruganesh , Jennifer Iglesias , R. Ravi , Laura Sanità

We establish quantitative estimates for solutions $u(t,x)$ to the fractional nonlinear diffusion equation, $\partial_t u +(-\Delta)^s (u^m)=0$ in the whole range of exponents $m>0$, $0<s<1$. The equation is posed in the whole space…

偏微分方程分析 · 数学 2013-10-08 Matteo Bonforte , Juan Luis Vazquez