中文
相关论文

相关论文: On equations defining coincident root loci

200 篇论文

We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.

动力系统 · 数学 2016-05-03 Jia-Yuan Dai

Let X be a locally compact Abelian group. We consider linear forms of independent random variables with values in X. In doing so, one of the coefficients of the linear forms is a random variable with a Bernoulli distribution. For some…

概率论 · 数学 2025-10-06 Gennadiy Feldman

In this manuscript, we study the arrangements of the roots in the complex plane for the lacunary harmonic polynomials called harmonic trinomials. We provide necessary and sufficient conditions so that two general harmonic trinomials have…

经典分析与常微分方程 · 数学 2024-05-01 Gerardo Barrera , Waldemar Barrera , Juan Pablo Navarrete

We study the rate of convergence for (variational) eigenvalues of several non-linear problems involving oscillating weights and subject to different kinds of boundary conditions in bounded domains.

偏微分方程分析 · 数学 2012-08-29 Julian Fernandez Bonder , Juan P. Pinasco , Ariel M. Salort

In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…

信息论 · 计算机科学 2015-05-01 Cristina Flaut

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

交换代数 · 数学 2025-02-11 Piotr Maćkowiak , Motaz Mokatren

We discuss the problem of defining a logic for analogical reasoning, and sketch a solution in the style of the semantics for Counterfactual Conditionals, Preferential Structures, etc.

计算机科学中的逻辑 · 计算机科学 2019-10-08 Karl Schlechta

Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…

种群与进化 · 定量生物学 2024-10-22 Chloe E. Shiff , Noah A. Rosenberg

We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…

代数几何 · 数学 2022-10-05 Sabrina Alexandra Gaube , Bernd Schober

We consider the problem of searching for proofs in sequential presentations of logics with multiplicative (or intensional) connectives. Specifically, we start with the multiplicative fragment of linear logic and extend, on the one hand, to…

计算机科学中的逻辑 · 计算机科学 2007-05-23 James Harland , David Pym

We study existence and multiplicity of positive radial solutions for a coupled elliptic system in exterior domains where the nonlinearities depend on the gradients and the boundary conditions are nonlocal. We use a non-standard cone to…

泛函分析 · 数学 2020-01-01 F. Cianciaruso , L. Muglia , P. Pietramala

Let $P$ be a planar $n$-gon with the sidelengths $a_1, \ldots, a_n$ and let us denote by $L=L(P)$ the corresponding planar polygonal linkage. We are concerned with the problem of finding conditions on the sidelengths $a_i$ which guarantee…

代数几何 · 数学 2025-08-18 Ana Diakvnishvili

We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford's $\alpha$-model.

种群与进化 · 定量生物学 2019-03-29 Tomás M. Coronado , Arnau Mir , Francesc Rosselló

We consider overdetermined problems related to the fractional capacity. In particular we study $s$-harmonic functions defined in unbounded exterior sets or in bounded annular sets, and having a level set parallel to the boundary. We first…

偏微分方程分析 · 数学 2023-01-26 Giulio Ciraolo , Luigi Pollastro

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

计算复杂性 · 计算机科学 2017-04-20 Jean-Yves Moyen , Jakob Grue Simonsen

Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…

组合数学 · 数学 2023-11-14 Grégory Chatel , Vincent Pilaud

Necessary conditions for a domain $\Omega\subset \mathbb C^n$ admitting a local plurisubharmonic defining function on the boundary are given. In tandem, we give an algorithm to construct a local plurisubharmonic defining function on the…

复变函数 · 数学 2020-08-12 Luka Mernik

We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…

组合数学 · 数学 2024-05-21 Karl Dilcher , Larry Ericksen

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

泛函分析 · 数学 2016-06-07 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

Given a variety defined over a field of characteristic zero and an algebraically integrable foliation of corank less than or equal to two, we show the existence of a categorical quotient, defined on the non-empty open set of stable points,…

代数几何 · 数学 2021-10-13 Federico Bongiorno