中文
相关论文

相关论文: A composition of Condorcet domains

200 篇论文

We consider a smooth and bounded domain of dimension d>1 and we construct solutions to the wave equation with Dirichlet boundary conditions which contradict the Strichartz estimates of the free space, at least for a subset of the usual…

偏微分方程分析 · 数学 2010-02-08 Oana Ivanovici

Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$-element poset. A lower bound of order $\sqrt{n}$ was found by Goodwillie. We provide a sublinear upper bound for each $d$. For $d=2$, our bound is…

组合数学 · 数学 2014-04-02 Benjamin Reiniger , Elyse Yeager

Determining if two protocols can be securely composed requires analyzing not only their additive properties but also their destructive properties. In this paper we propose a new composition method for constructing protocols based on…

密码学与安全 · 计算机科学 2009-09-01 Bela Genge , Iosif Ignat , Piroska Haller

We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as…

数论 · 数学 2021-10-12 Joerg Bruedern , Trevor D. Wooley

Using an integral formula on a homogeneous Siegel domain, we show a necessary and sufficient condition for composition operators on the weighted Bergman space of a minimal bounded homogeneous domain to be compact. To describe the…

泛函分析 · 数学 2011-05-10 Satoshi Yamaji

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

组合数学 · 数学 2019-06-03 Francisco Criado , Andrew Newman

In this paper, we introduce the notion of a $w$-Hilbert domain and investigate its basic properties. More precisely, we explore its relationship with Hilbert domains, strong Mori domains, and UMT domains by providing various examples using…

交换代数 · 数学 2026-03-23 Hyungtae Baek

Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental research problem of CDCs is to determine the maximum number of…

信息论 · 计算机科学 2025-08-05 Gang Wang , Hong-Yang Yao , Fang-Wei Fu

The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…

数论 · 数学 2008-06-05 Anne-Marie Bergé

Given a convex domain and its convex sub-domain we prove a variant of domain monotonicity for the Neumann eigenvalues of the Laplacian. As an application of our method we also obtain an upper bound for Neumann eigenvalues of the Laplacian…

度量几何 · 数学 2023-09-11 Kei Funano

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…

信息论 · 计算机科学 2016-11-15 Yang Ding

We address the problem of topology of quadrature domains, namely we give upper bounds on the connectivity of the domain in terms of the number of nodes and their multiplicities in the quadrature identity.

复变函数 · 数学 2015-08-20 Seung-Yeop Lee , Nikolai Makarov

Topological measurements are increasingly being accepted as an important tool for quantifying complex structures. In many applications, these structures can be expressed as nodal domains of real-valued functions and are obtained only…

概率论 · 数学 2020-05-29 Konstantin Mischaikow , Thomas Wanner

In this paper we examine the problem of inference in Bayesian Networks with discrete random variables that have very large or even unbounded domains. For example, in a domain where we are trying to identify a person, we may have variables…

人工智能 · 计算机科学 2012-12-12 Rita Sharma , David L Poole

We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…

组合数学 · 数学 2010-04-23 Milan Janjic

We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…

概率论 · 数学 2014-01-09 Richard Arratia , Fred Kochman

We propose a probabilistic approach to select a subset of a \textit{target domain representative keywords} from a candidate set, contrasting with a context domain. Such a task is crucial for many downstream tasks in natural language…

计算与语言 · 计算机科学 2022-06-07 Pritom Saha Akash , Jie Huang , Kevin Chen-Chuan Chang , Yunyao Li , Lucian Popa , ChengXiang Zhai

In the paper the complex geodesics of a convex domain in $\mathbb C^n$ are studied. One of the main results of the paper provides certain necessary condition for a holomorphic map to be a complex geodesic for a convex domain in $\mathbb…

复变函数 · 数学 2017-09-18 Sylwester Zając , Paweł Zapałowski

We establish necessary and sufficient conditions for boundedness of composition operators on the most general class of Hilbert spaces of entire Dirichlet series with real frequencies. Depending on whether or not the space contains any…

复变函数 · 数学 2017-10-11 Minh Luan Doan , Le Hai Khoi

A topological space is domain-representable (or, has a domain model) if it is homeomorphic to the maximal point space $\mbox{Max}(P)$ of a domain $P$ (with the relative Scott topology). We first construct an example to show that the set of…

一般拓扑 · 数学 2025-02-27 Xiaoyong Xi , Chong Shen , Dongsheng Zhao