English
Related papers

Related papers: A New Approach to Examine q-Steiner Systems

200 papers

In this paper, we establish existence of solutions to an indefinite coupled non-linear system. We use partial coercivity to establish existence of a critical point to an indefinite functional and thus the existence of solutions on both…

Mathematical Physics · Physics 2018-10-19 Joseph Esposito

In this paper we prove that rank metric codes with special properties imply the existence of $q$-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a $[2d,d,d]$ dually almost MRD code $C\leq…

Combinatorics · Mathematics 2017-09-05 F. Arias , J. de la Cruz , J. Rosenthal , W. Willems

We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…

Combinatorics · Mathematics 2008-04-11 Carl Bracken

The aim of this work is to establish the existence, uniqueness and q-Gevrey character of formal power series solutions of q-analogues of analytic doubly-singular equations. Using a new family of Nagumo norms adapted for q-differences we…

General Mathematics · Mathematics 2023-07-31 Sergio A. Carrillo , Alberto Lastra

By solving an infinite nonlinear system of $q$-difference equations one constructs a chain of $q$-difference operators. The eigenproblems for the chain are solved and some applications, including the one related to $q$-Hahn orthogonal…

Mathematical Physics · Physics 2007-05-23 Alina Dobrogowska , Anatol Odzijewicz

We examine the emergence and suppression of signatures of quantum Darwinism when the system of interest interacts with a complex, structured environment. We introduce an extended spin-star model where the system is coupled to $N$…

Quantum Physics · Physics 2021-09-22 Eoghan Ryan , Mauro Paternostro , Steve Campbell

We study point-line incidence structures and their properties in the projective plane. Our motivation is the problem of the existence of $(n_4)$ configurations, still open for few remaining values of $n$. Our approach is based on…

Computational Geometry · Computer Science 2023-11-14 Jürgen Bokowski , Vincent Pilaud

We develop a unified framework for identifying bounds to maximum resonant nonlinear optical susceptibilities, and for "inverse designing" quantum-well structures that can approach such bounds. In special cases (e.g. second-harmonic…

The Steiner Tree Problem (STP) is a well-known NP-hard combinatorial optimization problem, which has wide applications in network design, integrated circuit layout, bioinformatics, and other fields. However, traditional algorithms often…

Quantum Physics · Physics 2026-03-05 Dan Li , Xiang-Hui Wu , Ji-Rong Liu

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

Information Theory · Computer Science 2019-02-07 Chunming Tang , Cunsheng Ding , Maosheng Xiong

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

Statistical Mechanics · Physics 2024-12-24 Eduardo J. Aguilar , Valmir C. Barbosa , Raul Donangelo , Sergio R. Souza

We propose an analogue of Dubrovin's conjecture for the case where Fano manifolds have quantum connections of exponential type. It includes the case where the quantum cohomology rings are not necessarily semisimple. The conjecture is…

Algebraic Geometry · Mathematics 2021-01-18 Fumihiko Sanda , Yota Shamoto

We consider the issue of answering unions of conjunctive queries (UCQs) with disjunctive existential rules and mappings. While this issue has already been well studied from a chase perspective, query rewriting within UCQs has hardly been…

Databases · Computer Science 2023-06-12 Michel Leclère , Marie-Laure Mugnier , Guillaume Pérution-Kihli

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…

Mathematical Physics · Physics 2015-05-13 Frédérick Tremblay , Alexander V. Turbiner , Pavel Winternitz

Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…

Dynamical Systems · Mathematics 2020-07-23 Simon Baker

The aim of this paper is twofold. Firstly, we determine which blow-ups of products of projective spaces at general points are varieties of Fano type, and give boundary divisors making these spaces log Fano pairs. Secondly, we describe…

Algebraic Geometry · Mathematics 2017-04-25 John Lesieutre , Jinhyung Park

We give several examples of pairs of non-isomorphic cubic fourfolds whose Fano varieties of lines are birationally equivalent (and in one example isomorphic). Two of our examples, which are special families of conjecturally irrational…

Algebraic Geometry · Mathematics 2024-12-20 Corey Brooke , Sarah Frei , Lisa Marquand

A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…

Combinatorics · Mathematics 2019-04-30 Francesco Pavese

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…

Databases · Computer Science 2019-04-02 Pablo Barceló , Miguel Romero , Thomas Zeume
‹ Prev 1 3 4 5 6 7 10 Next ›