中文
相关论文

相关论文: Combinatorial problems in finite geometry and lacu…

200 篇论文

We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations…

最优化与控制 · 数学 2025-10-01 Robert Schüler , Achill Schürmann

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

数论 · 数学 2015-03-19 Dijana Kreso , Robert F. Tichy

We study the geometry of $\mathcal{Q}$-conic arrangements in the complex projective plane. These are arrangements consisting of smooth conics and they admit certain quasi-homogeneous singularities. We show that such $\mathcal{Q}$-conic…

代数几何 · 数学 2023-04-24 Piotr Pokora

We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…

量子代数 · 数学 2017-09-19 Kohei Motegi

The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…

组合数学 · 数学 2011-04-07 Volker Kaibel

A selection of open problems in the theory of composites is presented. Particular attention is drawn to the question of whether two-dimensional, two-phase, composites with general geometries have the same set of possible effective tensors…

偏微分方程分析 · 数学 2021-06-09 Graeme W. Milton

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

代数几何 · 数学 2024-05-24 Jiajun Hu , Jian Xiao

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…

组合数学 · 数学 2007-05-23 Rade T. Zivaljevic

In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.

组合数学 · 数学 2022-07-04 Beáta Bényi , Toshiki Matsusaka

This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as…

组合数学 · 数学 2014-07-14 Hal Schenck

In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…

代数几何 · 数学 2026-02-04 Artur Bromboszcz , Bartosz Jarosławski , Piotr Pokora

We revisit the coordinatisation method for projective planes. First, we discuss how the behaviour of the additive and multiplicative loops can be described in terms of its action on the "vertical" line, and how this means one can…

组合数学 · 数学 2016-09-07 Robert S. Coulter

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

统计力学 · 物理学 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

最优化与控制 · 数学 2024-12-11 Gabriela Kováčová , Birgit Rudloff

We survey results on the hardness of approximating combinatorial optimization problems.

计算复杂性 · 计算机科学 2007-05-23 Luca Trevisan

We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…

组合数学 · 数学 2010-04-13 D. A. Macinic

The application of combinatorial optimization problems to solving the problems of planning processes for industries based on a fund of reconfigurable production resources is considered. The results of their solution by mixed integer…

最优化与控制 · 数学 2022-12-06 M. V. Saramud , E. A. Spirin , E. P. Talay , I. I. Pikalov

Let $C$ be a complex irreducible plane curve that is not the vanishing locus of a modular polynomial. We show that $C$ contains finitely many real algebraic curves whose projection on each coordinate axis is a union of special geodesics.

数论 · 数学 2026-03-31 Matteo Tamiozzo

This is a survey of old and new problems and results in additive number theory.

数论 · 数学 2025-10-28 Melvyn B. Nathanson

We show how to solve computationally a combinatorial problem about the possible number of roots orthogonal to a vector of given length in $E_8$. We show that the moduli space of K3 surfaces with polarisation of degree 2d is also of general…

代数几何 · 数学 2010-08-31 A. Peterson , G. K. Sankaran